Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP.
Cody Murray
,
R. Ryan Williams
Venue
A*
STOC
Year
2018
Proceedings
STOC
DBLP record
conf/stoc/MurrayW18 ↗
Browse the full
STOC paper archive
.