Hanke Bremer. Obere und untere Schranke für die Komplexität von Booleschen Funktionen. In H. Barkhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975. Volume 33 of Lecture Notes in Computer Science, pages 99-102, Springer, 1975.
@inproceedings{Bremer75, title = {Obere und untere Schranke für die Komplexität von Booleschen Funktionen}, author = {Hanke Bremer}, year = {1975}, researchr = {https://researchr.org/publication/Bremer75}, cites = {0}, citedby = {0}, pages = {99-102}, booktitle = {Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975}, editor = {H. Barkhage}, volume = {33}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-07407-4}, }