NC algorithm for evaluating monotone planar circuits

A. L. Delcher, S. Rao Kosaraju

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)369-375
Number of pages7
JournalSIAM Journal on Computing
Volume24
Issue number2
StatePublished - Apr 1995
Externally publishedYes

Fingerprint

Monotone
Polynomials
Turing machines
Polynomial
Networks (circuits)
Turing Machine
Open Problems
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

Delcher, A. L., & Kosaraju, S. R. (1995). NC algorithm for evaluating monotone planar circuits. SIAM Journal on Computing, 24(2), 369-375.

NC algorithm for evaluating monotone planar circuits. / Delcher, A. L.; Kosaraju, S. Rao.

In: SIAM Journal on Computing, Vol. 24, No. 2, 04.1995, p. 369-375.

Research output: Contribution to journalArticle

Delcher, AL & Kosaraju, SR 1995, 'NC algorithm for evaluating monotone planar circuits', SIAM Journal on Computing, vol. 24, no. 2, pp. 369-375.
Delcher AL, Kosaraju SR. NC algorithm for evaluating monotone planar circuits. SIAM Journal on Computing. 1995 Apr;24(2):369-375.
Delcher, A. L. ; Kosaraju, S. Rao. / NC algorithm for evaluating monotone planar circuits. In: SIAM Journal on Computing. 1995 ; Vol. 24, No. 2. pp. 369-375.
@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",
month = "4",
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/4

Y1 - 1995/4

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

M3 - Article

AN - SCOPUS:0029289933

VL - 24

SP - 369

EP - 375

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 2

ER -