Using Flexibility in P-Circuits by Boolean Relations

DOI10.1109/TC.2015.2409849MaRDI QIDQ2985749zbMATH OpenOpenAlexFDO

Authors A. Bernasconi, Valentina Ciriani, Gabriella Trucco, Tiziano Villa

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2015.2409849

Mathematics Subject Classification ID

Recommendations

• Membrane Computing
• Towards an algebraic theory of Boolean circuits.
• On the complexity and depth of circuits that realize partial Boolean functions
• scientific article; zbMATH DE number 4204280
• On the complexity of realization of partial Boolean functions by circuits of functional elements
• scientific article; zbMATH DE number 4187721
• On circuit functionality in Boolean networks
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
• The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
• On the complexity of planar Boolean circuits

Cited in

(1)

• Literal Selection in Switching Lattice Design

This page was built for publication: Using Flexibility in P-Circuits by Boolean Relations

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