Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits

Cancellations are known to be helpful in efficient algebraic computation of polynomials over fields. We define a notion of cancellation in Boolean circuits and define Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization of monotone Boolean circuits. We show that in the absence of cancellation, Boolean circuits require super-polynomial size to compute the determinant interpreted over GF(2). This non-monotone Boolean function is known to be in P. In the spirit of monotone complexity classes, we define complexity classes based on non-cancellative Boolean circuits. We show that when the Boolean circuit model is restricted by withholding cancellation, P and popular classes within P are restricted as well, but classes NP and above remain unchanged.

[1]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[2]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[3]  田中 圭介,et al.  On the complexity of negation-limited Boolean networks , 1993 .

[4]  Carme Àlvarez,et al.  A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[5]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Éva Tardos,et al.  The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..

[8]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[9]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[10]  H. Venkateswaran.  Circuit Definitions of Nondeterministic Complexity Classes , 1992, SIAM J. Comput..

[11]  Miklos Santha,et al.  Polynomial Size Constant Depth Circuits with a Limited Number of Negations , 1991, STACS.

[12]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[13]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[14]  Noam Nisan,et al.  Lower bounds for non-commutative computation , 1991, STOC '91.

[15]  Michael Sipser,et al.  Structure in monotone complexity , 1991 .

[16]  Leslie G. Valiant,et al.  Negation can be exponentially powerful , 1979, Theor. Comput. Sci..

[17]  Tetsuro Nishino,et al.  On the complexity of negation-limited Boolean networks , 1994, STOC '94.

[18]  Yuri Gurevich,et al.  Monotone versus positive , 1987, JACM.

[19]  Michael Sipser,et al.  Boolean Function Complexity: Monotone Complexity , 1992 .

[20]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[21]  M. Sipser,et al.  Monotone Separation of Logspace from NC. , 1991 .

[22]  Michael Sipser,et al.  Monotone separation of logspace from NC/sup 1/ , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.