The combinational complexity of equivalence
From MaRDI portal
Publication:1228356
DOI10.1016/0304-3975(76)90073-6zbMath0333.68032OpenAlexW2025723778MaRDI QIDQ1228356
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90073-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Models of lower-bounds proofs ⋮ A 3n-lower bound on the network complexity of Boolean functions ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ On the combinational complexity of certain symmetric Boolean functions ⋮ Characterization of all optimal networks for a simultaneous computation of AND and NOR ⋮ New lower bounds on circuit size of multi-output functions
Cites Work
This page was built for publication: The combinational complexity of equivalence
