( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Lower Bound for Randomized Algebraic Decision Trees.

, , , и . STOC, стр. 612-619. ACM, (1996)

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.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Werner Karpinski

 

Другие публикации лиц с тем же именем

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , и . SODA, стр. 74-83. ACM/SIAM, (2002)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , и . CoRR, (2014)Polynomial time approximation schemes for dense instances of NP-hard problems., , и . STOC, стр. 284-293. ACM, (1995)On real Turing machines that toss coins., , , , и . STOC, стр. 335-342. ACM, (1995)A Lower Bound for Randomized Algebraic Decision Trees., , , и . STOC, стр. 612-619. ACM, (1996)Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis., , и . ISSAC, стр. 117-122. ACM, (1992)Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , и . SIAM J. Comput., 19 (6): 1059-1063 (1990)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , и . Algorithmica, 80 (2): 560-575 (2018)Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.. FCT, том 9210 из Lecture Notes in Computer Science, стр. 3-11. Springer, (2015)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , и . CPM, том 1075 из Lecture Notes in Computer Science, стр. 39-49. Springer, (1996)