The following pages link to Jonas Holmerin (Q1874410):
Displaying 11 items.
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- (Q2754129) (← links)
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε (Q3579212) (← links)
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (Q3580955) (← links)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)
- (Q4737146) (← links)
- (Q4737227) (← links)
- (Q4817288) (← links)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- STACS 2005 (Q5710674) (← links)
