Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version)

Klaus Kriegel, Stephan Waack. Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 227-233, Springer, 1985.

@inproceedings{KriegelW85,
  title = {Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version)},
  author = {Klaus Kriegel and Stephan Waack},
  year = {1985},
  researchr = {https://researchr.org/publication/KriegelW85},
  cites = {0},
  citedby = {0},
  pages = {227-233},
  booktitle = {Fundamentals of Computation Theory, FCT  85, Cottbus, GDR, September 9-13, 1985},
  editor = {Lothar Budach},
  volume = {199},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-15689-5},
}