NC algorithm for evaluating monotone planar circuits

A. L. Delcher; S. Rao Kosaraju

doi:10.1137/S0097539792226278

NC algorithm for evaluating monotone planar circuits

A. L. Delcher, S. Rao Kosaraju

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

Goldschlager first established that a special case of the monotone planar circuit problem can be solved by a Turing machine in O(log²n) space. Subsequently, Dymond and Cook refined the argument and proved that the same class can be evaluated in O(log²n) time with a polynomial number of processors. In this paper, we prove that the general monotone planar circuit value problem can be evaluated in O(log⁴n) time with a polynomial number of processors, settling an open problem posed by Goldschlager and Parberry.

Original language	English (US)
Pages (from-to)	369-375
Number of pages	7
Journal	SIAM Journal on Computing
Volume	24
Issue number	2
DOIs	https://doi.org/10.1137/S0097539792226278
State	Published - 1995
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1137/S0097539792226278

Cite this

@article{ac2561ee332d4c079840fc8181775997,

title = "NC algorithm for evaluating monotone planar circuits",

abstract = "Goldschlager first established that a special case of the monotone planar circuit problem can be solved by a Turing machine in O(log2n) space. Subsequently, Dymond and Cook refined the argument and proved that the same class can be evaluated in O(log2n) time with a polynomial number of processors. In this paper, we prove that the general monotone planar circuit value problem can be evaluated in O(log4n) time with a polynomial number of processors, settling an open problem posed by Goldschlager and Parberry.",

author = "Delcher, {A. L.} and Kosaraju, {S. Rao}",

year = "1995",

doi = "10.1137/S0097539792226278",

language = "English (US)",

volume = "24",

pages = "369--375",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - NC algorithm for evaluating monotone planar circuits

AU - Delcher, A. L.

AU - Kosaraju, S. Rao

PY - 1995

Y1 - 1995

N2 - Goldschlager first established that a special case of the monotone planar circuit problem can be solved by a Turing machine in O(log2n) space. Subsequently, Dymond and Cook refined the argument and proved that the same class can be evaluated in O(log2n) time with a polynomial number of processors. In this paper, we prove that the general monotone planar circuit value problem can be evaluated in O(log4n) time with a polynomial number of processors, settling an open problem posed by Goldschlager and Parberry.

AB - Goldschlager first established that a special case of the monotone planar circuit problem can be solved by a Turing machine in O(log2n) space. Subsequently, Dymond and Cook refined the argument and proved that the same class can be evaluated in O(log2n) time with a polynomial number of processors. In this paper, we prove that the general monotone planar circuit value problem can be evaluated in O(log4n) time with a polynomial number of processors, settling an open problem posed by Goldschlager and Parberry.

UR - http://www.scopus.com/inward/record.url?scp=0029289933&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029289933&partnerID=8YFLogxK

U2 - 10.1137/S0097539792226278

DO - 10.1137/S0097539792226278

M3 - Article

AN - SCOPUS:0029289933

SN - 0097-5397

VL - 24

SP - 369

EP - 375

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

NC algorithm for evaluating monotone planar circuits

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this