Upper bounds for monotone planar circuit value and variants
From MaRDI portal
Publication:626664
DOI10.1007/s00037-009-0265-5zbMath1213.68266OpenAlexW1987413881MaRDI QIDQ626664
Meena Mahajan, Nutan Limaye, M. N. Jayalal Sarma
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0265-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators ⋮ A generalization of Spira's theorem and circuits with small segregators or separators ⋮ Balancing bounded treewidth circuits ⋮ On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Classification of Planar Upward Embedding ⋮ Succinct certification of monotone circuits ⋮ Succinct monotone circuit certification: planarity and parameterized complexity ⋮ Upward planar graphs and their duals ⋮ The Monotone Circuit Value Problem with Bounded Genus Is in NC
This page was built for publication: Upper bounds for monotone planar circuit value and variants
