Publications
Publications
Referenzen
25.
Marek Karpinski
Boolean circuit complexity of algebraic interpolation problems
CSL '88 (Duisburg, 1988) Band 385 aus Lecture Notes in Comput. Sci.
Seite 138--147.
Herausgeber: Springer, Berlin,
1989
24.
Lisa Hellerstein und Marek Karpinski
Learning read-once formulas using membership queries
Proceedings of the Second Annual Workshop on Computational Learning Theory (Santa Cruz, CA, 1989) , Seite 146--161.
Herausgeber: Morgan Kaufmann, San Mateo, CA,
1989
23.
Elias Dahlhaus und Marek Karpinski
Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
Theoret. Comput. Sci., 61(2-3):121--136
1988
22.
M. Karpinski und K. W. Wagner
The computational complexity of graph problems with succinct multigraph representation
Z. Oper. Res., 32(3-4):201--211
1988
21.
Elias Dahlhaus und Marek Karpinski
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems (extended abstract)
SWAT 88 (Halmstad, 1988) Band 318 aus Lecture Notes in Comput. Sci.
Seite 139--144.
Herausgeber: Springer, Berlin,
1988
20.
Marek Karpinski und Zbigniew W. Ras
Learning Machine for Probabilistically Describable Concepts
ISMIS , Seite 353--362.
1988
19.
Marek Karpinski und Rutger Verbeek
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
Inform. and Comput., 75(2):178--189
1987
18.
Marek Karpinski und Rutger Verbeek
Randomness, provability, and the separation of Monte Carlo time and space
Computation theory and logic Band 270 aus Lecture Notes in Comput. Sci.
Seite 189--207.
Herausgeber: Springer, Berlin,
1987
17.
Marek Karpinski und Rutger Verbeek
On the power of two-way random generators and the impossibility of deterministic polyspace simulation
Inform. and Control, 71(1-2):131--142
1986
16.
Marek Karpinski und Rutger Verbeek
There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator
Inform. and Control, 67(1-3):158--162
1985
15.
Marek Karpiński
Decidability of â??Skolem matrix emptiness problemâ?? entails constructability of exact regular expression
Theoret. Comput. Sci., 17(1):99--102
1982
14.
Marek Karpiński
The ultimate equivalence of iterated homomorphisms is recursively unsolvable
Band 54 aus GMD-Studien [GMD Studies]
Herausgeber: Gesellschaft für Mathematik und Datenverarbeitung mbH Bonn, St. Augustin,
1980
ISBN: 3-88457-009-9
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