Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs.
Pasin Manurangsi
,
Prasad Raghavendra
Venue
A*
ICALP
Year
2017
Proceedings
ICALP
DBLP record
conf/icalp/ManurangsiR17 ↗
Browse the full
ICALP paper archive
.