An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits
From MaRDI portal
Publication:4834386
DOI10.1137/S0097539792226278zbMath0827.68051OpenAlexW154638891MaRDI QIDQ4834386
Arthur L. Delcher, S. Rao Kosaraju
Publication date: 18 June 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792226278
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A generalization of Spira's theorem and circuits with small segregators or separators ⋮ The complexity of the bootstraping percolation and other problems ⋮ The complexity of the asynchronous prediction of the majority automata ⋮ The complexity of the majority rule on planar graphs ⋮ The complexity of the comparator circuit value problem
This page was built for publication: An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits
