Items where Author is "Karpinski, M."

MPIM Preprint

Berman, P. and Karpinski, M. and Scott, A. D. (2003) Approximation hardness and satisfiability of bounded ocurrence instances of SAT. MPIM Preprint Series 2003 (44).

Karpinski, M. and de la Vega, W. F. and Kenyon, C. (2003) Approximation schemes for metric minimum bisection and partitioning problems. MPIM Preprint Series 2003 (45).

Ablayev, F. and Gainutdinova, A. and Karpinski, M. (2003) On computational power of quantum branching programs. MPIM Preprint Series 2003 (43).

Grigoriev, D. and Karpinski, M. (1991) Algorithms for sparse rational interpolation. MPIM Preprint Series 1991 (5).

Grigoriev, D. Y. and Karpinski, M. and Singer, M. F. (1991) Computational complexity of sparse real algebraic function interpolation. MPIM Preprint Series 1991 (76).

Grigoriev, D. and Karpinski, M. and Odlyzko, A. (1991) Nondivisibility of sparse polynomials is in NP under the extended Riemann hypothesis. MPIM Preprint Series 1991 (6).

Grigoriev, D. and Karpinski, M. (1991) An approximation algorithm for the number of zeros of arbitrary polynomials over GF [q]. MPIM Preprint Series 1991 (13).

Grigoriev, D. Y. and Singer, M. F. and Karpinski, M. (1990) Interpolation of sparse rational functions without knowing bounds on exponents. MPIM Preprint Series 1990 (10).