default search action

combined dblp search
author search
venue search
publication search

ask others

"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs."

Pasin Manurangsi, Prasad Raghavendra (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2017.78

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/ManurangsiR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ManurangsiR17
Pasin Manurangsi, Prasad Raghavendra:
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. ICALP 2017: 78:1-78:15

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.