Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers.
Evgeny Demenkov
,
Alexander S. Kulikov
Venue
B
MFCS
Year
2011
Proceedings
MFCS
DBLP record
conf/mfcs/DemenkovK11 ↗
Browse the full
MFCS paper archive
.