Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alon, N., Boppana, R.B.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1–22 (1987)
2. Amano, K., Maruoka, A.: A superpolynomial lower bound for a circuit computing the clique function with at most (1/6)loglogn negation gates. SIAM J. Comput. 35(1), 201–216 (2005)
3. Amano, K., Maruoka, A., Tarui, J.: On the negation-limited circuit complexity of merging. Discrete Applied Mathematics 126(1), 3–8 (2003)
4. Andreev, A.E.: On a method for obtaining lower bounds for the complexity of individual monotone functions. Sov. Math. Doklady 31(3), 530–534 (1985)
5. Beals, R., Nishino, T., Tanaka, K.: On the complexity of negation-limited Boolean networks. SIAM J. Comput. 27(5), 1334–1347 (1998)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献