The combinational complexity of equivalence

DOI10.1016/0304-3975(76)90073-6MaRDI QIDQ1228356zbMATH OpenOpenAlexFDO

Authors Claus Peter Schnorr

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen

Cited in

(6)

• Models of lower-bounds proofs
• A 3n-lower bound on the network complexity of Boolean functions
• New lower bounds on circuit size of multi-output functions
• On the combinational complexity of certain symmetric Boolean functions
• Improving \(3N\) circuit complexity lower bounds
• Characterization of all optimal networks for a simultaneous computation of AND and NOR

This page was built for publication: The combinational complexity of equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228356)