Marek Karpinski

Known as: Karpinski 
Marek Karpinski is a computer scientist and mathematician known for his research in the theory of algorithms and their applications, combinatorial… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2017
051019862017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
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
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
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
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
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
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
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
The authors consider the problem of reconstructing (i.e., interpolating) a t-sparse multivariate polynomial given a black box… (More)
Is this relevant?