Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Addition is exponentially harder than counting for shallow monotone circuits.
Xi Chen
,
Igor C. Oliveira
,
Rocco A. Servedio
Venue
A*
STOC
Year
2017
Proceedings
STOC
DBLP record
conf/stoc/ChenOS17 ↗
Browse the full
STOC paper archive
.