( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two

, , and . CoRR, (2008)

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

A Lower Bound for Randomized Algebraic Decision Trees., , , and . STOC, page 612-619. ACM, (1996)Polynomial time approximation schemes for dense instances of NP-hard problems., , and . STOC, page 284-293. ACM, (1995)On real Turing machines that toss coins., , , , and . STOC, page 335-342. ACM, (1995)Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis., , and . ISSAC, page 117-122. ACM, (1992)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , and . CoRR, (2014)Correctness of Constructing Optimal Alphabetic Trees Revisited., , and . Theor. Comput. Sci., 180 (1-2): 309-324 (1997)On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields., , , and . Theor. Comput. Sci., 84 (2): 151-164 (1991)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)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)