Author:
Babai László,Hajnal Péter,Szemerédi Endre,Turán György
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference21 articles.
1. N. Alon and R. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, in press.
2. On a method of obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dokl. Akad. Nauk SSSR,1985
3. Limits on the power of concurrent-write parallel machines;Beame,1986
4. P. Beane and S. Cook, 1985, private communication.
5. A timespace tradeoff for sorting on nonoblivious machines;Borodin;J. Comput. System Sci,1981
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献