Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference61 articles.
1. Σ11-formulae on finite structures;Ajtal;Annals of Pure and Applied Logic,1983
2. Two lower bounds for branching programs;Ajtal,1986
3. N. Alon and R. B. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, to appear.
4. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dokl. Ak. Nauk. SSSR,1985
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献