Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
Leonard Pitt
,
Manfred K. Warmuth
Venue
A*
STOC
Year
1989
Proceedings
STOC
DBLP record
conf/stoc/PittW89 ↗
Browse the full
STOC paper archive
.