Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP.
Yuichi Yoshida
Venue
A*
STOC
Year
2011
Proceedings
STOC
DBLP record
conf/stoc/Yoshida11 ↗
Browse the full
STOC paper archive
.