( 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

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)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)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)Approximating Huffman Codes in Parallel., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 845-855. Springer, (2002)The Equivalences Problems for Binary EOL-Systems are Decidable.. FCT, volume 56 of Lecture Notes in Computer Science, page 423-434. Springer, (1977)On a Sublinear Time Parallel Construction of Optimal Binary Search Trees., and . Parallel Process. Lett., 8 (3): 387-397 (1998)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract), and . FOCS, page 166-172. IEEE Computer Society, (1987)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , and . CoRR, (2014)