Content deleted Content added
→History: Rossman |
m →References: added url to Håstad's thesis |
||
Line 41:
*{{cite journal|first1=Noga|last1=Alon|first2=Ravi B.|last2=Boppana|title=The monotone circuit complexity of Boolean functions|journal=Combinatorica|volume=7|year=1987|number=1|pages=1–22}}
*{{cite journal|first1=Merrick L.|last1=Furst|first2=James B.|last2=Saxe|first3=Michael|last3=Sipser|title=Parity, circuits, and the polynomial-time hierarchy|journal=Mathematical Systems Theory|volume=17|number=1|pages=13–27|year=1984}}
*{{citation|first=Johan|last=Håstad|title=Computational limitations of small depth circuits|year=1987|publisher=Ph.D. thesis, Massachusetts Institute of Technology|url=http://www.nada.kth.se/~johanh/thesis.pdf|postscript=.}}
*{{cite conference|first=William|last=Hesse|title=Division is in uniform TC<sup>0</sup>|year=2001|pages=104–114|booktitle=Proc. 28th International Colloquium on Automata, Languages and Programming|publisher=Springer}}
*{{cite journal|first1=Ran|last1=Raz|first2=Pierre|last2=McKenzie|title=Separation of the monotone NC hierarchy|journal=Combinatorica|volume=19|number=3|year=1999|pages=403–435}}
| |||