Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
A Non-linear Time Lower Bound for Boolean Branching Programs.
Mikls Ajtai
Venue
A*
FOCS
Year
1999
Proceedings
FOCS
DBLP record
conf/focs/Ajtai99 ↗
Browse the full
FOCS paper archive
.