Jonas Holmerin

Publication Activity (10 Years)

Years Active: 2000-2008
Publications (10 Years): 0

Publications

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