Publications
Publications
Referenzen
85.
Marek Karpinski und Juergen Wirtgen
On Approximation Hardness of the Bandwidth Problem
Electronic Colloquium on Computational Complexity (ECCC), 4(41)
1997
84.
Marek Karpinski und Angus Macintyre
Approximating the volume of general Pfaffian bodies
Structures in logic and computer science Band 1261 aus Lecture Notes in Comput. Sci.
Seite 162--173.
Herausgeber: Springer, Berlin,
1997
83.
Andris Ambainis, Kalvis Aps\=\itis, Cristian Calude, R&#363si\cns Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala und Juris Smotrovs
Effects of Kolmogorov complexity present in inductive inference as well
Algorithmic learning theory (Sendai, 1997) Band 1316 aus Lecture Notes in Comput. Sci.
Seite 244--259.
Herausgeber: Springer, Berlin,
1997
82.
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski und Wojciech Rytter
On the complexity of pattern matching for highly compressed two-dimensional texts
Combinatorial pattern matching (Aarhus, 1997) Band 1264 aus Lecture Notes in Comput. Sci.
Seite 40--51.
Herausgeber: Springer, Berlin,
1997
81.
Marek Karpinski und Angus Macintyre
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
Band 54
Seite 169--176.
1997
80.
Marek Karpinski
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
Randomization and approximation techniques in computer science (Bologna, 1997) Band 1269 aus Lecture Notes in Comput. Sci.
Seite 1--14.
Herausgeber: Springer, Berlin,
1997
79.
Andris Ambainis, R&#363si\cns Freivalds und Marek Karpinski
Weak and strong recognition by 2-way randomized automata
Randomization and approximation techniques in computer science (Bologna, 1997) Band 1269 aus Lecture Notes in Comput. Sci.
Seite 175--185.
Herausgeber: Springer, Berlin,
1997
78.
Alexander Chistov, Gábor Ivanyos und Marek Karpinski
Polynomial time algorithms for modules over finite dimensional algebras
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI) , Seite 68--74.
Herausgeber: ACM, New York,
1997
77.
Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide und Roman Smolensky
A lower bound for randomized algebraic decision trees
Comput. Complexity, 6(4):357--375
1996
76.
Joachim von zur Gathen, Marek Karpinski und Igor Shparlinski
Counting curves and their projections
Comput. Complexity, 6(1):64--99
1996
75.
Marek Karpinski und Igor Shparlinski
On some approximation problems concerning sparse polynomials over finite fields
Theoret. Comput. Sci., 157(2):259--266
1996
74.
Dima Grigoriev, Marek Karpinski und Roman Smolensky
Randomization and the computational power of analytic and algebraic decision trees
Comput. Complexity, 6(4):376--388
1996
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