"Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with ..."

Subhash Khot, Rishi Saket (2014)

> Home

Details and statistics

DOI: 10.1109/FOCS.2014.30

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/KhotS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/KhotS14
Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. FOCS 2014: 206-215

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.