The following pages link to Marek Karpinski (Q396628):
Displayed 50 items.
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Resolution for quantified Boolean formulas (Q1891159) (← links)
- A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure (Q1971500) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- Approximating Huffman codes in parallel (Q2466011) (← links)
- Improved approximation algorithms for the quality of service multicast tree problem (Q2484000) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- (Q2758399) (← links)
- (Q2762518) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- Approximating Subdense Instances of Covering Problems (Q2840726) (← links)
- New Inapproximability Bounds for TSP (Q2872120) (← links)
- Schemes for deterministic polynomial factoring (Q2883816) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2965501) (← links)
- (Q3038625) (← links)
- Approximability of Dense Instances of Nearest Codeword Problem (Q3046504) (← links)
- The mixing time of Glauber dynamics for coloring regular trees (Q3057064) (← links)
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament (Q3060716) (← links)
- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 (Q3060717) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- (Q3126174) (← links)
- (Q3135191) (← links)
- (Q3138901) (← links)
- (Q3138965) (← links)
- Improved approximation of Max-Cut on graphs of bounded degree (Q3150283) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 (Q3183443) (← links)
- Approximate Counting of Matchings in (3,3)-Hypergraphs (Q3188911) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields (Q3495652) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058) (← links)
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems (Q3578321) (← links)
- Random sampling and approximation of MAX-CSP problems (Q3579226) (← links)
- Approximation schemes for clustering problems (Q3581243) (← links)
- Tensor decomposition and approximation schemes for constraint satisfaction problems (Q3581412) (← links)
- 8/7-approximation algorithm for (1,2)-TSP (Q3581504) (← links)
- Stopping Times, Metrics and Approximate Counting (Q3613753) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator (Q3716302) (← links)
- On the power of two-way random generators and the impossibility of deterministic poly-space simulation (Q3766849) (← links)
- The computational complexity of graph problems with succinct multigraph representation (Q3801600) (← links)
- (Q3804207) (← links)