Cyclic Boolean circuits

DOI10.1016/J.DAM.2012.03.039zbMATH Open1302.94076OpenAlexW2155097858MaRDI QIDQ442202FDOQ442202

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Interpolation and SAT-based model checking.
• Title not available (Why is that?)
• Complexity theory of parallel time and hardware
• On the Inversion Complexity of a System of Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized ternary simulation of sequential circuits
• 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)