Complexity theory of parallel time and hardware
Information and Computation
An $\cal NC$ Algorithm for Evaluating Monotone Planar Circuits
SIAM Journal on Computing
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Searching Constant Width Mazes Captures the AC0 Hierarchy
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On Parallel Evaluation of Classes of Circuits
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of planarity testing
Information and Computation
The circuit value problem is log space complete for P
ACM SIGACT News
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
LTL Path Checking Is Efficiently Parallelizable
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
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
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circuit value problem (MPCVP) is in NC2, and Limaye et. al. improved the bound to LogCFL. Barrington et. al. showed that evaluating monotone upward stratified circuits, a restricted version of the one-input-face MPCVP, is in LogDCFL. In this paper, we prove that the unrestricted one-input-face MPCVP is also in LogDCFL. We also show this problem to be L-hard under quantifier free projections.