@inproceedings{d66c7ae2f7784f3eb5ca703fb88a0750,

title = "Note on the power of threshold circuits",

abstract = "The author presents a very simple proof of the fact that any language accepted by polynomial-size depth-k unbounded-fan-in circuits of AND and OR gates is accepted by depth-three threshold circuits of size n raised to the power O(logkn). The proof uses much of the intuition of S. Toda's result that the polynomial hierarchy is contained in P#P (30th Ann. Symp. Foundations Comput. Sci., pp. 514-519, 1989).",

author = "Eric Allender",

year = "1989",

month = nov,

language = "English (US)",

isbn = "0818619821",

series = "Annual Symposium on Foundations of Computer Science - Proceedings",

publisher = "Publ by IEEE",

pages = "580--584",

booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",

note = "30th Annual Symposium on Foundations of Computer Science ; Conference date: 30-10-1989 Through 01-11-1989",

}