Marek Karpinski is a computer scientist and mathematician known for his research in the theory of algorithms and their applications, combinatorialâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Manuel Arora, GÃ¡bor Ivanyos, Marek Karpinski, Nitin Saxena
- Electronic Colloquium on Computational Complexity
- 2012

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field Fq has many known efficient, but randomizedâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
- J. Comput. Syst. Sci.
- 2003

In a maximum-r-constraint satisfaction problem with variables fx1; x2;y;xng; we are given Boolean functions f1; f2;y; fm eachâ€¦Â (More)

Is this relevant?

2001

2001

Analysis of genomes evolving by inversions leads to a general combina-torial problem of Sorting by Reversals, MIN-SBR, theâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Alan M. Frieze, Ravi Kannan
- Combinatorica
- 1999

We give algorithms to nd the following simply described approximation to a given matrix. Given an mn matrix A with entriesâ€¦Â (More)

Is this relevant?

1998

1998

- Gunter Blache, Marek Karpinski, Juergen Wirtgen
- Electronic Colloquium on Computational Complexity
- 1998

The bandwidth problem is the problem of enumerating the vertices of a given graph G such that the maximum diierence between theâ€¦Â (More)

Is this relevant?

1996

1996

- Marek Karpinski, Igor E. Shparlinski
- Theor. Comput. Sci.
- 1996

We obtain new lower bounds on the number of non-zeros of sparse polynomials and give a fully polynomial time (&,6) approximationâ€¦Â (More)

Is this relevant?

1994

1994

- Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov
- STOC
- 1994

Membership to a Polyhedron by Algebraic Decision Trees DIMA GRIGORIEV * MAREK KARPINSKI t NICOLAI VOROBJOV $ We describe a newâ€¦Â (More)

Is this relevant?

1992

1992

- Nader H. Bshouty, Richard Cleve
- FOCS
- 1992

W e investigate the parallel complexity of learning formulas f rom membership and equivalence queries. W e consider a number ofâ€¦Â (More)

Is this relevant?

1991

1991

We study computational complexity of learning read-once formulas over diierent boolean bases. In particular we design aâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Dima Grigoriev, Marek Karpinski, Michael F. Singer
- SIAM J. Comput.
- 1990

The authors consider the problem of reconstructing (i.e., interpolating) a t-sparse multivariate polynomial given a black boxâ€¦Â (More)

Is this relevant?