Depth Lower Bounds against Circuits with Sparse Orientation*
From MaRDI portal
Publication:4595590
DOI10.3233/FI-2017-1515zbMath1383.68037OpenAlexW2605157281MaRDI QIDQ4595590
M. N. Jayalal Sarma, Sajin Koroth
Publication date: 5 December 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2017-1515
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Lower bounds for Boolean circuits of bounded negation width ⋮ On the mystery of negations in circuits: structure vs power ⋮ Lower Bounds for DeMorgan Circuits of Bounded Negation Width
This page was built for publication: Depth Lower Bounds against Circuits with Sparse Orientation*