Upper Bounds for Monotone Planar Circuit Value and Variants

Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and for the special case of upward stratified circuits, it is known to be in LogDCFL. In this paper we re-examine the complexity of MPCVP, with special attention to circuits with cylindrical embeddings. We characterize cylindricality, which is stronger than planarity but strictly generalizes upward planarity, and make the characterization partially constructive. We use this construction, and four key reduction lemmas, to obtain several improvements. We show that stratified cylindrical monotone circuits can be evaluated in LogDCFL, and arbitrary cylindrical monotone circuits can be evaluated in AC1(LogDCFL), while monotone circuits with one-input-face planar embeddings can be evaluated in LogCFL. For monotone circuits with focused embeddings, we show an upper bound of AC1(LogDCFL). We re-examine the NC3 algorithm for general MPCVP, and note that it is in AC1(LogCFL) = SAC2. Finally, we consider extensions beyond MPCVP. We show that monotone circuits with toroidal embeddings can, given such an embedding, be evaluated in NC. Also, special kinds of arbitrary genus circuits can also be evaluated in NC. We also show that planar non-monotone circuits with polylogarithmic negation-height can be evaluated in NC.

[1]  E. Gilbert.  Review: A. A. Markov, On the Inversion Complexity of a System of Functions , 1965 .

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

[3]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[4]  H. Venkateswaran,et al.  Properties that characterize LOGCFL , 1987, J. Comput. Syst. Sci..

[5]  Tanmoy Chakraborty,et al.  One-Input-Face MPCVP Is Hard for L, But in LogDCFL , 2006, FSTTCS.

[6]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[7]  Michael Forster,et al.  Radial Level Planarity Testing and Embedding in Linear Time , 2003, Graph Drawing.

[8]  Meena Mahajan,et al.  Evaluating Monotone Circuits on Cylinders, Planes and Tori , 2006, STACS.

[9]  Michael J. Fischer.  Hauptvortrag: The complexity of negation-limited networks - A brief survey , 1975, Automata Theory and Formal Languages.

[10]  Peter Bro Miltersen,et al.  On monotone planar circuits , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[11]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[12]  Eric Allender,et al.  Topology inside NC1 , 2004, Electron. Colloquium Comput. Complex..

[13]  Leslie M. Goldschlager,et al.  A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem , 1980, Information Processing Letters.

[14]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[15]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[16]  Vijaya Ramachandran,et al.  Planarity Testing in Parallel , 1994, J. Comput. Syst. Sci..

[17]  S. Rao Kosaraju,et al.  On Parallel Evaluation of Classes of Circuits , 1990, FSTTCS.

[18]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[19]  Stephen A. Cook,et al.  Complexity Theory of Parallel Time and Hardware , 1989, Inf. Comput..

[20]  A. White.  Graphs, Groups and Surfaces , 1973 .

[21]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[22]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[23]  Kristoffer Arnsfelt Hansen.  Constant Width Planar Computation Characterizes ACC0 , 2005, Theory of Computing Systems.

[24]  David Kelly.  Fundamentals of planar ordered sets , 1987, Discret. Math..

[25]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[26]  Eric Allender,et al.  The Directed Planar Reachability Problem , 2005, FSTTCS.

[27]  Gary L. Miller,et al.  Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1988, SIAM J. Comput..

[28]  Eric Allender,et al.  Topology inside NC 1 , 2004 .

[29]  Hannah Honghua Yang,et al.  An NC algorithm for the general planar monotone circuit value problem , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[30]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[31]  Meena Mahajan,et al.  The complexity of planarity testing , 2000, Inf. Comput..

[32]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[33]  A. A. Markov.  On the Inversion Complexity of a System of Functions , 1958, JACM.

[34]  Eric Allender,et al.  Topology inside NC/sup 1/ , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[35]  Eric Allender,et al.  Grid graph reachability problems , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[36]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[37]  Kristoffer Arnsfelt Hansen,et al.  Circuits on cylinders , 2006, computational complexity.

[38]  S. Rao Kosaraju,et al.  An NC Algorithm for Evaluating Monotone Planar Circuits , 1995, SIAM J. Comput..