Back to Results
First PageMeta Content
NP-complete problems / Graph coloring / Combinatorial optimization / Maximum cut / Cut / Probabilistically checkable proof / Edge coloring / NP-complete / Graph theory / Theoretical computer science / Mathematics


On Khot’s unique games conjecture
Add to Reading List

Document Date: 2012-05-01 11:13:39


Open Document

File Size: 259,89 KB

Share Result on Facebook

City

Safra / /

Country

Sudan / /

IndustryTerm

polynomial-time constructible solutions / by-product / symmetric decoding algorithm / time computing optimal solutions / polynomial-time algorithm / polynomial-time algorithms / polynomialtime solutions / cryptographic protocols / classical algorithm / near optimal solutions / approximate solutions / polynomialtime algorithm / Approximation algorithms / near-optimal solution / search problems / /

Organization

National Science Foundation / /

Person

Max Cut / LUCA TREVISAN / Williamson / Subhash Khot / /

Position

representative / /

Technology

Vazirani algorithm / Spectral Partitioning algorithm / Approximation algorithms / symmetric decoding algorithm / polynomialtime algorithm / known algorithms / classical algorithm / polynomial-time algorithms / polynomial-time algorithm / /

SocialTag