Mike Paterson. Boolean Circuit Complexity. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, editors, Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings. Volume 650 of Lecture Notes in Computer Science, pages 187, Springer, 1992.
@inproceedings{Paterson92,
title = {Boolean Circuit Complexity},
author = {Mike Paterson},
year = {1992},
researchr = {https://researchr.org/publication/Paterson92},
cites = {0},
citedby = {0},
pages = {187},
booktitle = {Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings},
editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita},
volume = {650},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-56279-6},
}