Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
DLT
/
Paper
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.
Hermann Gruber
,
Markus Holzer
Venue
C
DLT
Year
2007
Proceedings
Developments in Language Theory
DBLP record
conf/dlt/GruberH07 ↗
Browse the full
DLT paper archive
.