Travelled to:1 × Canada
1 × Spain
1 × Switzerland
1 × USA
Collaborated with:∅ L.Engebretsen S.Khot A.Russell
Talks about:inapproxim (2) approxim (2) within (2) vertex (2) result (2) equat (2) cover (2) hard (2) hypergraph (1) uniform (1)
Person: Jonas Holmerin
DBLP: Holmerin:Jonas
Contributed to:
2004
200220022000Wrote 5 papers:
- STOC-2004-HolmerinK #equation #linear #verification
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (JH, SK), pp. 11–20.
- ICALP-2002-EngebretsenHR #equation #finite
- Inapproximability Results for Equations over Finite Groups (LE, JH, AR), pp. 73–84.
- ICALP-2002-Holmerin
- Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs (JH), pp. 1005–1016.
- STOC-2002-Holmerin #approximate
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.
- ICALP-2000-EngebretsenH #approximate #clique
- Clique Is Hard to Approximate within n1-o(1) (LE, JH), pp. 2–12.