Limiting Negations in Bounded Treewidth and Upward Planar Circuits

DOI10.1007/978-3-642-15155-2_37zbMath1287.68057OpenAlexW128724489MaRDI QIDQ3586102

Hongyu Liang, M. N. Jayalal Sarma, Jing (Selena) He

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_37

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Size-treewidth tradeoffs for circuits computing the element distinctness function

This page was built for publication: Limiting Negations in Bounded Treewidth and Upward Planar Circuits