Evaluating monotone circuits on cylinders, planes and tori

Authors:
Nutan Limaye;Meena Mahajan;M. N. Jayalal Sarma
Affiliations:
The Institute of Mathematical Sciences, Chennai, India;The Institute of Mathematical Sciences, Chennai, India;The Institute of Mathematical Sciences, Chennai, India
Venue:
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Year:
2006

Citing 15
Cited 5

Fundamentals of planar ordered sets

Discrete Mathematics
Algorithms for plane representations of acyclic digraphs

Theoretical Computer Science
Efficient parallel evaluation of straight-line code and arithmetic circuits

SIAM Journal on Computing
Complexity theory of parallel time and hardware

Information and Computation
Properties that characterize LOGCFL

Journal of Computer and System Sciences
Planarity testing in parallel

Proceedings of the 30th IEEE symposium on Foundations of computer science
An $\cal NC$ Algorithm for Evaluating Monotone Planar Circuits

SIAM Journal on Computing
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
On Parallel Evaluation of Classes of Circuits

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
On Monotone Planar Circuits

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
The complexity of planarity testing

Information and Computation
The monotone and planar circuit value problems are 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
Topology Inside NC1

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
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
Classification of planar upward embedding

GD'11 Proceedings of the 19th international conference on Graph Drawing
The duals of upward planar graphs on cylinders

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the curve complexity of upward planar drawings

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Upward planar drawings on the standing and the rolling cylinders

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We revisit monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC3 in general, and in LogDCFL for the special case of upward stratified circuits. 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 monotone circuits with embeddings that are stratified cylindrical, cylindrical, planar one-input-face and focused can be evaluated in LogDCFL, AC1(LogDCFL), LogCFL and AC1(LogDCFL) respectively. We note that the NC3 algorithm for general MPCVP is in AC1(LogCFL) = SAC2. Finally, we show that monotone circuits with toroidal embeddings can, given such an embedding, be evaluated in NC.