More on the complexity of negation-limited circuits

Robert Beals, Tetsuro Nishino, Keisuke Tanaka. More on the complexity of negation-limited circuits. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 585-595, ACM, 1995. [doi]

Abstract

Abstract is missing.