Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference43 articles.
1. N. Alon and R. B. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, to appear.
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic and Discrete Methods,1987
3. On the isomorphism problem for graphs of thickness two;Asano,1985
4. Relativizations of the P =? NP question;Baker;SIAM J. Comput.,1975
5. A note on Boolean circuits of constant width;Barrington,1986
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献