Selected papers that cite this one
- Robert Beals, Tetsuro Nishino, and Keisuke Tanaka. More on the complexity of negation-limited circuits. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 585-595, Las Vegas, Nevada, 29 May-1 June 1995.
- Robert Beals, Tetsuro Nishino, and Keisuke Tanaka. On the complexity of negation-limited Boolean networks. SIAM Journal on Computing, 27(5):1334-1347, October 1998.
- Keisuke Tanaka and Tetsuro Nishino. On the complexity of negation-limited Boolean networks (preliminary version). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 38-47, Montréal, Québec, Canada, 23-25 May 1994.
- Keisuke Tanaka, Tetsuro Nishino, and Robert Beals. Negation-limited circuit complexity of symmetric functions. Information Processing Letters, 59(5):273-279, 9 September 1996.