Searching for authors named "Marek Karpinski" – sorted by Relevance.
137 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
-
Randomized Ω(n²) Lower Bound for Knapsack
- …Randomized\Omega (n 2 ) Lower Bound for Knapsack Dima Grigoriev Marek Karpinski y Abstract…
- Add To MetaCart
-
Bounding VC-Dimension for Neural Networks: Progress and Prospects
- …Bounding VC-Dimension for Neural Networks: Progress and Prospects Marek Karpinski ? (Bonn) Angus…
- Add To MetaCart
-
Lower Time Bounds for Randomized Computation
- …Lower Time Bounds for Randomized Computation R��usi��ns Freivalds and Marek Karpinski y…
- Add To MetaCart
-
Lower Space Bounds for Randomized Computation
- … University of Latvia LV-1459 Riga Marek Karpinski Dept. of Computer Science University of Bonn 53117 Bonn…
- Add To MetaCart
-
Randomized Navigation to a Wall through Convex Obstacles
- …Randomized Navigation to a Wall through Convex Obstacles Piotr Berman Marek Karpinski y…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
