Publications
Publications
Referenzen
109.
Dima Grigoriev und Marek Karpinski
An exponential lower bound for depth 3 arithmetic circuits
STOC '98 (Dallas, TX)
Seite 577--582.
Herausgeber: ACM, New York,
1999
108.
Sergei Evdokimov, Marek Karpinski und Ilia Ponomarenko
Compact cellular algebras and permutation groups
Band 197/198
Seite 247--267.
1999
107.
Piotr Berman und Marek Karpinski
On some tighter inapproximability results (extended abstract)
Automata, languages and programming (Prague, 1999) Band 1644 aus Lecture Notes in Comput. Sci.
Seite 200--209.
Herausgeber: Springer, Berlin,
1999
106.
Marek Karpinski und Igor Shparlinski
On the computational hardness of testing square-freeness of sparse polynomials
Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999) Band 1719 aus Lecture Notes in Comput. Sci.
Seite 492--497.
Herausgeber: Springer, Berlin,
1999
105.
Andris Ambainis, Richard Bonner, R&#363si\cns Freivalds, Marats Golovkins und Marek Karpinski
Quantum finite multitape automata
SOFSEM'99: theory and practice of informatics (Milovy) Band 1725 aus Lecture Notes in Comput. Sci.
Seite 340--348.
Herausgeber: Springer, Berlin,
1999
104.
Dima Grigoriev und Marek Karpinski
Randomized (n^2) lower bound for knapsack
STOC '97 (El Paso, TX)
Seite 76--85.
Herausgeber: ACM, New York,
1999
103.
Marek Karpinski
Randomized complexity of linear arrangements and polyhedra
Fundamentals of computation theory (Ia\csi, 1999) Band 1684 aus Lecture Notes in Comput. Sci.
Seite 1--12.
Herausgeber: Springer, Berlin,
1999
102.
Marek Karpinski und Wojciech Rytter
Alphabet-independent optimal parallel search for three-dimensional patterns
Theoret. Comput. Sci., 205(1-2):243--260
1998
101.
Dima Grigoriev, Marek Karpinski und Andrew C. Yao
An exponential lower bound on the size of algebraic decision trees for MAX
Comput. Complexity, 7(3):193--203
1998
100.
Dima Grigoriev und Marek Karpinski
Computing the additive complexity of algebraic circuits with root extracting
SIAM J. Comput., 27(3):694--701
1998
99.
Elias Dahlhaus und Marek Karpinski
Matching and multidimensional matching in chordal and strongly chordal graphs
Discrete Appl. Math., 84(1-3):79--91
1998
98.
Marek Karpinski und Wojciech Rytter
On a sublinear time parallel construction of optimal binary search trees
Parallel Process. Lett., 8(3):387--397
1998
Seite:  
Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next
Export als:
BibTeX, XML