Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly.
Jn Pich
,
Rahul Santhanam
Venue
A*
STOC
Year
2021
Proceedings
STOC
DBLP record
conf/stoc/PichS21 ↗
Browse the full
STOC paper archive
.