Publications
Publications
Referenzen
49.
Marek Karpinski und Thorsten Werther
VC dimension and sampling complexity of learning sparse polynomials and rational functions
Computational learning theory and natural learning systems, Vol. I aus Bradford Book
Seite 331--354.
Herausgeber: MIT Press, Cambridge, MA,
1994
48.
Rusins Freivalds, Marek Karpinski und Carl H. Smith
Co-Learning of Total Recursive Functions
COLT , Seite 190--197.
Herausgeber: ACM, New York
1994
47.
Marek Karpinski und Michael Luby
Approximating the number of zeroes of a {GF[2]} polynomial
J. Algorithms, 14(2):280--287
1993
46.
Dana Angluin, Lisa Hellerstein und Marek Karpinski
Learning read-once formulas with queries
J. Assoc. Comput. Mach., 40(1):185--210
1993
45.
Elias Dahlhaus, Péter Hajnal und Marek Karpinski
On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs
J. Algorithms, 15(3):367--384
1993
44.
Marek Karpinski und Thorsten Werther
VC dimension and uniform learnability of sparse polynomials and rational functions
SIAM J. Comput., 22(6):1276--1285
1993
43.
Dima Grigoriev und Marek Karpinski
A zero-test and an interpolation algorithm for the shifted sparse polynomials
Applied algebra, algebraic algorithms and error-correcting codes (San Juan, PR, 1993) Band 673 aus Lecture Notes in Comput. Sci.
Seite 162--169.
Herausgeber: Springer, Berlin,
1993
42.
D. Grigoriev, M. Karpinski und M. F. Singer
Computational complexity of sparse real algebraic function interpolation
Computational algebraic geometry (Nice, 1992) Band 109 aus Progr. Math.
Seite 91--104.
Herausgeber: Birkhäuser Boston, Boston, MA,
1993
41.
Peter Bürgisser, Marek Karpinski und Thomas Lickteig
On randomized semi-algebraic test complexity
Band 9
Seite 231--251.
1993
40.
Marek Karpinski und Rutger Verbeek
On randomized versus deterministic computation
Automata, languages and programming (Lund, 1993) Band 700 aus Lecture Notes in Comput. Sci.
Seite 227--240.
Herausgeber: Springer, Berlin,
1993
39.
Elias Dahlhaus, Marek Karpinski und Pierre Kelsen
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
Inform. Process. Lett., 42(6):309--313
1992
38.
Elias Dahlhaus und Marek Karpinski
Perfect matching for regular graphs is {AC^0}-hard for the general matching problem
J. Comput. System Sci., 44(1):94--102
1992
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