Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
Yizhi Huang
,
Rahul Ilango
,
Hanlin Ren
Venue
A*
STOC
Year
2023
Proceedings
STOC
DBLP record
conf/stoc/HuangIR23 ↗
Browse the full
STOC paper archive
.