Jonas Holmerin

19 papers A* 5A 4C 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2008 J jnl
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP.
Random Struct. Algorithms
Lars Engebretsen, Jonas Holmerin
2005 A conf
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP.
STACS
Lars Engebretsen, Jonas Holmerin
2005 J jnl
Three-query PCPs with perfect completeness over non-Boolean domains.
Random Struct. Algorithms
Lars Engebretsen, Jonas Holmerin
2004 A* conf
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection.
STOC
Jonas Holmerin, Subhash Khot
2004 J jnl
Inapproximability results for equations over finite groups.
Theor. Comput. Sci.
Lars Engebretsen, Jonas Holmerin, Alexander Russell
2003 A conf
A Strong Inapproximability Gap for a Generalization of Minimum Bisection.
CCC
Jonas Holmerin, Subhash Khot
2003 A conf
Three-Query PCPs with Perfect Completeness over non-Boolean Domains.
CCC
Lars Engebretsen, Jonas Holmerin
2003 J jnl
Towards optimal lower bounds for clique and chromatic number.
Theor. Comput. Sci.
Lars Engebretsen, Jonas Holmerin
2002 A* conf
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs.
ICALP
Jonas Holmerin
2002 J jnl
Inapproximability Results for Equations over Finite Groups
Electron. Colloquium Comput. Complex.
Lars Engebretsen, Jonas Holmerin, Alexander Russell
2002 A* conf
Inapproximability Results for Equations over Finite Groups.
ICALP
Lars Engebretsen, Jonas Holmerin, Alexander Russell
2002 J jnl
Three-Query PCPs with Perfect Completeness over non-Boolean Domains
Electron. Colloquium Comput. Complex.
Lars Engebretsen, Jonas Holmerin
2002 A conf
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε.
CCC
Jonas Holmerin
2002 A* conf
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon.
STOC
Jonas Holmerin
2001 J jnl
Towards Optimal Lower Bounds For Clique and Chromatic Number
Electron. Colloquium Comput. Complex.
Lars Engebretsen, Jonas Holmerin
2001 J jnl
Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within 2-epsilon
Electron. Colloquium Comput. Complex.
Jonas Holmerin
2000 A* conf
Clique Is Hard to Approximate within
ICALP
Lars Engebretsen, Jonas Holmerin
2000 C conf
Data Field Haskell.
Haskell
Jonas Holmerin, Björn Lisper
2000 — conf
Development of Parallel Algorithms in Data Field Haskell (Research Note).
Euro-Par
Jonas Holmerin, Björn Lisper