Skip to main navigation
Skip to search
Skip to main content
NYU Scholars Home
Help & FAQ
Home
Profiles
Research units
Research output
Search by expertise, name or affiliation
Hardness results for approximate hypergraph coloring
Subhash Khot
Computer Science
Research output
:
Contribution to journal
›
Conference article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Hardness results for approximate hypergraph coloring'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Log-log
100%
Hardness Results
100%
Hypergraph Coloring
100%
Uniform Hypergraph
75%
Proof System
50%
Probabilistically Checkable Proofs
50%
Verifier
25%
Parallel Repetition Theorem
25%
Absolute Constant
25%
2-colorable
25%
Long Code
25%
New Codes
25%
Approximate Coloring
25%
Non-Boolean
25%
Mathematics
Approximates
100%
Hypergraphs
100%
Integer
50%
Probabilistically checkable proofs
50%
Absolute Constant
25%
Long Code
25%
Computer Science
Proof System
100%