论文信息 - Monotone circuits for matching require linear depth

Monotone circuits for matching require linear depth

We prove that monotone circuits computing the perfect matching function on n-vertex graphs require Ω(n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits. CR categories: F.1.1, Models of Computation, Unbounded Action Devices. ∗This research was partially supported by the American-Israeli Binational Science Foundation grant number 87-00082

Ran Raz | Avi Wigderson | A. Wigderson | R. Raz

[1] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.

[2] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[3] Allan Borodin,et al. Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[5] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .

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

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

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

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

[10] Ran Raz,et al. Probabilistic communication complexity of Boolean relations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..

[12] Alexander A. Razborov. On the Distributional Complexity of Disjontness , 1990, ICALP.