( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
On BPP versus NPcoNP for ordered read-once branching programs.

, , and . Theor. Comput. Sci., 264 (1): 127-137 (2001)

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

An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions., , and . Nord. J. Comput., 4 (2): 172-186 (1997)On the Computational Complexity of Measuring Global Stability of Banking Networks., , , and . Algorithmica, 70 (4): 595-647 (2014)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , and . SODA, page 74-83. ACM/SIAM, (2002)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)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)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)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)., , , and . Dagstuhl Reports, 5 (6): 28-47 (2015)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , and . Algorithmica, 80 (2): 772-800 (2018)