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 AC 1(LogDCFL) respectively. We note that the NC3 algorithm for general MPCVP is in AC1(LogCFL) = SAC2. Fi-nally, we show that monotone circuits with toroidal embeddings can, given such an embedding, be evaluated in NC. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Limaye, N., Mahajan, M., & Jayalal Sarma, M. N. (2006). Evaluating monotone circuits on cylinders, planes and tori. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3884 LNCS, pp. 660–671). https://doi.org/10.1007/11672142_54
Mendeley helps you to discover research relevant for your work.