Computational Complexity
LTL Path Checking Is Efficiently Parallelizable
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.00 |
In this paper we show several results about monotone planar circuits. We show that monotone planar circuits of bounded width, with access to negated input variables, compute exactly the functions in non-uniform AC0 .This provides a striking contrast to the non-planar case, where exactly NC1 is computed. We show that the circuit value problem for monotone planar circuits, with inputs on the outer face only, can be solved in LOGDCFL \mathSC, improving a LOGCFL upper bound due to Dymond and Cook. We show that for monotone planar circuits, with in-puts on the outer face only, excessive depth compared to width is useless; any function computed by a monotone pla-nar circuit of width w with inputs on the outer face can be computed by a monotone planar circuit of width O(w) and depth w O(1) . Finally, we show that monotone planar read-once circuits, with inputs on the outer face only, can be efficiently learned using membership queries.