( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.

, , and . ISSAC, page 117-122. ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Werner Karpinski

 

Other publications of authors with the same name

On a Sublinear Time Parallel Construction of Optimal Binary Search Trees., and . Parallel Process. Lett., 8 (3): 387-397 (1998)Approximating the Volume of General Pfaffian Bodies., and . Structures in Logic and Computer Science, volume 1261 of Lecture Notes in Computer Science, page 162-173. Springer, (1997)On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields., , , and . Theor. Comput. Sci., 84 (2): 151-164 (1991)Correctness of Constructing Optimal Alphabetic Trees Revisited., , and . Theor. Comput. Sci., 180 (1-2): 309-324 (1997)Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)., , , and . Dagstuhl Reports, 5 (6): 28-47 (2015)Generalized Wong sequences and their applications to Edmonds' problems., , , and . Electron. Colloquium Comput. Complex., (2013)Effects of Kolmogorov Complexity Present in Inductive Inference as Well., , , , , , , and . ALT, volume 1316 of Lecture Notes in Computer Science, page 244-259. Springer, (1997)A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 15-24. Springer, (2010)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 39-49. Springer, (1996)Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.. FCT, volume 9210 of Lecture Notes in Computer Science, page 3-11. Springer, (2015)