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 language | English (US) |
---|---|
Pages (from-to) | 369-375 |
Number of pages | 7 |
Journal | SIAM Journal on Computing |
Volume | 24 |
Issue number | 2 |
DOIs | |
State | Published - 1995 |
Externally published | Yes |
ASJC Scopus subject areas
- General Computer Science
- General Mathematics