Cyclic Boolean circuits

DOI10.1016/j.dam.2012.03.039zbMath1302.94076OpenAlexW2155097858MaRDI QIDQ442202

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

feedbackcyclesBoolean functionsloopsBoolean circuitsDAGcombinational circuitscyclic circuits

Mathematics Subject Classification ID

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

Related Items (2)

Improving \(3N\) circuit complexity lower bounds ⋮ Evaluating Datalog via tree automata and cycluits

Cites Work

• Complexity theory of parallel time and hardware
• On the Inversion Complexity of a System of Functions
• Generalized ternary simulation of sequential circuits
• The Necessity of Closed Circuit Loops in Minimal Combinational Circuits
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic Boolean circuits