Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
What Can be Efficiently Reduced to the K-Random Strings?
Eric Allender
,
Harry Buhrman
,
Michal Kouck
Venue
A
STACS
Year
2004
Proceedings
STACS
DBLP record
conf/stacs/AllenderBK04 ↗
Browse the full
STACS paper archive
.