Jonas Holmerin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2008

More efficient queries in PCPs for NP and improved approximation hardness of maximum CSPLars Engebretsen, Jonas Holmerin. rsa, 33(4):497-514, 2008. [doi]

2005

More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSPLars Engebretsen, Jonas Holmerin. STACS 2005: 194-205 [doi]

Three-query PCPs with perfect completeness over non-Boolean domainsLars Engebretsen, Jonas Holmerin. rsa, 27(1):46-75, 2005. [doi]

2004

Inapproximability results for equations over finite groupsLars Engebretsen, Jonas Holmerin, Alexander Russell. TCS, 312(1):17-45, 2004. [doi]

A new PCP outer verifier with applications to homogeneous linear equations and max-bisectionJonas Holmerin, Subhash Khot. stoc 2004: 11-20 [doi]

2003

Three-Query PCPs with Perfect Completeness over non-Boolean DomainsLars Engebretsen, Jonas Holmerin. cocoon 2003: 284-299 [doi]

Towards optimal lower bounds for clique and chromatic numberLars Engebretsen, Jonas Holmerin. TCS, 1-3(299):537-584, 2003. [doi]

A Strong Inapproximability Gap for a Generalization of Minimum BisectionJonas Holmerin, Subhash Khot. cocoon 2003: 371-378 [doi]

2002

2001

Towards Optimal Lower Bounds For Clique and Chromatic NumberLars Engebretsen, Jonas Holmerin. eccc, 8(3), 2001. [doi]

Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within 2-epsilonJonas Holmerin. eccc, (094), 2001. [doi]

2000

Clique Is Hard to Approximate within ::::n:::::::1-::::o::::(1):::Lars Engebretsen, Jonas Holmerin. icalp 2000: 2-12 [doi]

Development of Parallel Algorithms in Data Field Haskell (Research Note)Jonas Holmerin, Björn Lisper. europar 2000: 762-766 [doi]

Data Field HaskellJonas Holmerin, Björn Lisper. ENTCS, 41(1):4, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL