Cyclic Boolean circuits

DOI10.1016/J.DAM.2012.03.039MaRDI QIDQ442202zbMATH OpenOpenAlexFDO

Authors Marc D. Riedel, Jehoshua Bruck

Publication date 10 August 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.03.039

zbMATH Keywords

feedbackBoolean circuitscyclesBoolean functionsloopsDAGcombinational circuitscyclic circuits

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Recommendations

• Universal circuits (Preliminary Report)
• Analysis of cyclic combinational circuits
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• scientific article; zbMATH DE number 4045650
• Towards an algebraic theory of Boolean circuits.

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 4088936 (Why is no real title available?)
• scientific article; zbMATH DE number 3655870 (Why is no real title available?)
• scientific article; zbMATH DE number 557615 (Why is no real title available?)
• Complexity theory of parallel time and hardware
• Generalized ternary simulation of sequential circuits
• Interpolation and SAT-based model checking.
• On the Inversion Complexity of a System of Functions
• The Necessity of Closed Circuit Loops in Minimal Combinational Circuits

Cited in

(5)

• Analysis of cyclic combinational circuits
• Separating OR, SUM, and XOR circuits
• Improving \(3N\) circuit complexity lower bounds
• Towards an algebraic theory of Boolean circuits.
• Evaluating Datalog via tree automata and cycluits

This page was built for publication: Cyclic Boolean circuits

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