Publications
Publications
Referenzen
37.
Michael Clausen, Andreas Dress, Johannes Grabmeier und Marek Karpinski
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
Theoret. Comput. Sci., 84(2, Algorithms Automat. Complexity Games):151--164
1991
36.
Peter Bürgisser, Marek Karpinski und Thomas Lickteig
Some computational problems in linear algebra as hard as matrix multiplication
Comput. Complexity, 1(2):131--155
1991
35.
Dima Yu. Grigoriev, Marek Karpinski und Michael F. Singer
The interpolation problem for k-sparse sums of eigenfunctions of operators
Adv. in Appl. Math., 12(1):76--81
1991
34.
Dima Grigoriev und Marek Karpinski
An approximation algorithm for the number of zeros of arbitrary polynomials over {GF[q]}
32nd Annual Symposium on Foundations of Computer Science (San Juan, PR, 1991)
Seite 662--669.
Herausgeber: IEEE Comput. Soc. Press, Los Alamitos, CA,
1991
33.
Marek Karpinski
Approximation Algorithms for Counting Problems in Finite Fields
FCT Band 529 aus Lecture Notes in Comput. Sci.
Seite 45--46.
Herausgeber: Springer, Berlin
1991
32.
Andreas Flögel, Marek Karpinski und Hans Kleine Büning
Subclasses of quantified Boolean formulas
Computer science logic (Heidelberg, 1990) Band 533 aus Lecture Notes in Comput. Sci.
Seite 145--155.
Herausgeber: Springer, Berlin,
1991
31.
Dima Grigoriev und Marek Karpinski
Algorithms for Sparse Rational Interpolation
ISSAC , Seite 7--13.
Herausgeber: ACM, New York
1991
30.
Marek Karpinski und Michael Luby
Approximating the number of zeroes of a {GF[2]} polynomial
Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1991) , Seite 300--303.
Herausgeber: ACM, New York,
1991
29.
Dima Yu. Grigoriev, Marek Karpinski und Michael F. Singer
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM J. Comput., 19(6):1059--1063
1990
28.
Dima Yu. Grigoriev, Marek Karpinski und Michael F. Singer
Interpolation of sparse rational functions without knowing bounds on exponents
31st Annual Symposium on Foundations of Computer Science, Vol. I, II (St. Louis, MO, 1990)
Seite 840--846.
Herausgeber: IEEE Comput. Soc. Press, Los Alamitos, CA,
1990
27.
Marek Karpinski und Friedhelm Meyer auf der Heide
On the complexity of genuinely polynomial computation
Mathematical foundations of computer science (Banská Bystrica, 1990) Band 452 aus Lecture Notes in Comput. Sci.
Seite 362--368.
Herausgeber: Springer, Berlin,
1990
26.
Andrzej Lingas und Marek Karpinski
Subtree isomorphism is NC reducible to bipartite perfect matching
Inform. Process. Lett., 30(1):27--32
1989
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