Abstract
In 1990, Subramanian [1990] defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (CCV). He and Mayr showed that NL ⊆ CC ⊆ P, and proved that in addition to CCV several other problems are complete for CC, including the stable marriage problem, and finding the lexicographically first maximal matching in a bipartite graph. Although the class has not received much attention since then, we are interested in CC because we conjecture that it is incomparable with the parallel class NC which also satisfies NL ⊆ NC ⊆ P, and note that this conjecture implies that none of the CC-complete problems has an efficient polylog time parallel algorithm. We provide evidence for our conjecture by giving oracle settings in which relativized CC and relativized NC are incomparable.
We give several alternative definitions of CC, including (among others) the class of problems computed by uniform polynomial-size families of comparator circuits supplied with copies of the input and its negation, the class of problems AC0-reducible to Ccv, and the class of problems computed by uniform AC0 circuits with AXccv gates. We also give a machine model for CC, which corresponds to its characterization as log-space uniform polynomial-size families of comparator circuits. These various characterizations show that CC is a robust class. Our techniques also show that the corresponding function class FCC is closed under composition. The main technical tool we employ is universal comparator circuits.
Other results include a simpler proof of NL ⊆ CC, a more careful analysis showing the lexicographically first maximal matching problem and its variants are CC-complete under AC0 many-one reductions, and an explanation of the relation between the Gale--Shapley algorithm and Subramanian’s algorithm for stable marriage.
This article continues the previous work of Cook et al. [2011], which focused on Cook-Nguyen style uniform proof complexity, answering several open questions raised in that article.
- K. Aehlig, S. Cook, and P. Nguyen. 2007. Relativizing small complexity classes and their theories. In Computer Science Logic, Jacques Duparc and Thomas Henzinger Eds., Lecture Notes in Computer Science, vol. 4646, Springer, Berlin/Heidelberg, 374--388. Google Scholar
Digital Library
- R. Anderson and E. Mayr. 1987. Parallelism and greedy algorithms. In Parallel and Distributed Computing (Advances in Computing Research), vol. 4, JAI Press, 17--38.Google Scholar
- David A. Mix Barrington, Neil Immerman, and Howard Straubing. 1990. On uniformity within {NC1}. J. Comput. Syst. Sci. 41, 3, 274--306. DOI:http://dx.doi.org/10.1016/0022-0000(90)90022-D. Google Scholar
Digital Library
- K. E. Batcher. 1968. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computer Conference. ACM, 307--314. Google Scholar
Digital Library
- S. Cook and P. Nguyen. 2010. Logical Foundations of Proof Complexity. Cambridge University Press. Google Scholar
Digital Library
- Stephen A. Cook. 1985. A taxonomy of problems with fast parallel algorithms. Inf. Cont. 64, 1--3, 2--22. DOI:http://dx.doi.org/10.1016/S0019-9958(85)80041-3. Google Scholar
Digital Library
- S. A. Cook, D. T. M. Lê, and Y. Ye. 2011. Complexity classes and theories for the comparator circuit value problem. arXiv abs/1106.4142.Google Scholar
- A. L. Delcher and S. Rao Kosaraju. 1995. An NC algorithm for evaluating monotone planar circuits. SIAM J. Comput. 24, 2, 369--375. DOI:http://dx.doi.org/10.1137/S0097539792226278. Google Scholar
Digital Library
- T. Feder. 1992. A new fixed point approach for stable networks and stable marriages. J. Comput. System Sci. 45, 2, 233--284. Google Scholar
Digital Library
- T. Feder. 1995. Stable Networks and Product Graphs. American Mathematical Society, Boston, MA. Google Scholar
Digital Library
- D. Gale and L. S. Shapley. 1962. College admissions and the stability of marriage. Amer. Math. Monthly 69, 1, 9--15.Google Scholar
Cross Ref
- Leslie M. Goldschlager. 1977. The monotone and planar circuit value problems are log space complete for P. SIGACT News 9, 2, 25--29. DOI:http://dx.doi.org/10.1145/1008354.1008356. Google Scholar
Digital Library
- R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. 1995. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Google Scholar
Digital Library
- R. Greenlaw and S. Kantabutra. 2008. On the parallel complexity of hierarchical clustering and CC-complete problems. Complexity 14, 2, 18--28. Google Scholar
Digital Library
- R. M. Karp, E. Upfal, and A. Wigderson. 1986. Constructing a perfect matching is in random NC. Combinatorica 6, 1, 35--48. Google Scholar
Digital Library
- Karp, R. M. and Wigderson, A. 1985. A fast parallel algorithm for the maximal independent set problem. J. ACM 32, 4, 762--773. Google Scholar
Digital Library
- D. T. M. Lê, S. A. Cook, and Y. Ye. 2011. A formal theory for the complexity class associated with the stable marriage problem. In Computer Science Logic (CSL’11) - 25th International Workshop/20th Annual Conference of the EACSL (Leibniz International Proceedings in Informatics (LIPIcs)), Marc Bezem Ed., vol. 12, Dagstuhl, Germany, 381--395.Google Scholar
- E. W. Mayr and A. Subramanian. 1992. The complexity of circuit value and network stability. J. Comput. System Sci. 44, 2, 302--323. Google Scholar
Digital Library
- C. Moore and J. Machta. 2000. Internal diffusion-limited aggregation: Parallel algorithms and complexity. J. Stat. Phys. 99, 3, 661--690.Google Scholar
Cross Ref
- K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1, 105--113. Google Scholar
Digital Library
- V. Ramachandran and L.-C. Wang. 1991. Parallel algorithm and complexity results for telephone link simulation. In Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing. 378--385. Google Scholar
Digital Library
- Vijaya Ramachandran and Honghua Yang. 1996. An efficient parallel algorithm for the general planar monotone circuit value problem. SIAM J. Comput. 25, 2, 312--339. DOI:http://dx.doi.org/10.1137/S0097539793260775. Google Scholar
Digital Library
- A. Subramanian. 1990. The computational complexity of the circuit value and network stability problems. Ph.D. Dissertation, Department of Computer Science, Stanford University. Google Scholar
Digital Library
- A. Subramanian. 1994. A new approach to stable matching problems. SIAM J. Comput. 23, 4, 671--700. Google Scholar
Digital Library
- Honghua Yang. 1991. An NC algorithm for the general planar monotone circuit value problem. In Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing. 196--203. DOI:http://dx.doi.org/10.1109/SPDP.1991.218279. Google Scholar
Digital Library
Index Terms
The complexity of the comparator circuit value problem
Recommendations
The restrictive H-coloring problem
Structural decompositions, width parameters, and graph labelings (DAS 5)We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely the restrictive H-coloring and the ...
On the (non) NP-hardness of computing circuit complexity
CCC '15: Proceedings of the 30th Conference on Computational ComplexityThe Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k? This is the definitive problem of circuit synthesis, and it has been studied since the 1950s. ...
On the Space Complexity of Linear Programming with Preprocessing
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer ScienceIt is well known that Linear Programming is P-complete, with a logspace reduction. In this work we ask whether Linear Programming remains P-complete, even if the polyhedron (i.e., the set of linear inequality constraints) is a fixed polyhedron, for each ...






Comments