Searching for authors named Marek Karpinski – sorted by Relevance.
138 documents found, showing 1 through 10.
Next 10 →
-
On Approximability of Minimum Bisection Problem
- …On Approximability of Minimum Bisection Problem Marek Karpinski y University of Bonn Abstract…
- Cited by 4 (1 self) – Add To MetaCart
-
Approximating Bounded Degree Instances of NP-Hard Problems
- …Approximating Bounded Degree Instances of NP-Hard Problems Marek Karpinski y Abstract We…
- Cited by 8 (3 self) – Add To MetaCart
-
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
- … (Extended Version) Marek Karpinski y Abstract We survey recent results on the existence of polynomial…
- Cited by 17 (7 self) – Add To MetaCart
-
Boolean Circuit Complexity of Algebraic Interpolation Problems
- …Boolean Circuit Complexity of Algebraic Interpolation Problems Marek Karpinski Dept. of Computer…
- Cited by 8 (6 self) – Add To MetaCart
-
Randomized OBDDs and Model Checking
- …Randomized OBDDs and Model Checking Marek Karpinski Dept. of Computer Science University of Bonn…
- Cited by 1 (1 self) – Add To MetaCart
-
On Some Tighter Inapproximability Results
- …On Some Tighter Inapproximability Results Piotr Berman Marek Karpinski y Abstract We prove a…
- Add To MetaCart
-
An Exponential Lower Bound for Depth 3 Arithmetic Circuits
- …An Exponential Lower Bound for Depth 3 Arithmetic Circuits Dima Grigoriev Marek Karpinski y…
- Add To MetaCart
-
Algorithms for Sparse Rational Interpolation
- …Algorithms for Sparse Rational Interpolation Dima Grigoriev 1 Marek Karpinski 2 TR-91…
- Add To MetaCart
-
Complexity of Deciding Solvability of Polynomial Equations over p-adic Integers
- … Marek Karpinski y December, 1997 Abstract Consider a system of polynomial equations in n variables…
- Cited by 1 (0 self) – Add To MetaCart
-
Randomized Ω(n²) Lower Bound for Knapsack
- …Randomized\Omega (n 2 ) Lower Bound for Knapsack Dima Grigoriev Marek Karpinski y Abstract…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
