DocumentCode
3163540
Title
An NC algorithm for the general planar monotone circuit value problem
Author
Yang, Honghua
Author_Institution
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
fYear
1991
fDate
2-5 Dec 1991
Firstpage
196
Lastpage
203
Abstract
A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in a plane and that has only AND and OR gates. Although a special case of the planar monotone circuit value problem (PMCVP) has been shown to be in NC2, it was not known whether the general PMCVP is in NC. In the paper, the author first gives an NC2 algorithm to evaluate a layered one-input-face PMC using straight-line code parallel evaluation technique. He then applies the algorithm to a less restrictive one-input-face PMC. Finally, he gives an NC3 algorithm for the general PMCVP
Keywords
computational complexity; logic circuits; logic design; parallel algorithms; Boolean circuit; NC algorithm; general PMCVP; general planar monotone circuit value problem; planar monotone circuit; Algorithm design and analysis; Arithmetic; Circuits; Computational modeling; Concurrent computing; Embedded computing; Wires;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2310-1
Type
conf
DOI
10.1109/SPDP.1991.218279
Filename
218279
Link To Document