| Article Details | ||
|---|---|---|
| Title: | A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Pasin Manurangsi |
|
| Prasad Raghavendra |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: | ||
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1343104 | |
| DBLP Key: | conf/icalp/ManurangsiR17 | |
| Author Comments: | ||