Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).
Klaus Kriegel
,
Stephan Waack
Venue
B
FCT
Year
1985
Proceedings
FCT
DBLP record
conf/fct/KriegelW85 ↗
Browse the full
FCT paper archive
.