On the complexity of the evaluation of transient extensions of Boolean functions

MaRDI QIDQ4964007zbMATH OpenFDO

Authors Baiyu Li, Yuli Ye, Janusz Brzozowski

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1666, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.5

zbMATH Keywords

Boolean functioncircuitcomplexityevaluationgatehazardmulti-valued algebratransient algebratransient extension

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Fault detection; testing in circuits and networks (94C12)

Recommendations

• On the complexity of the evaluation of transient extensions of Boolean functions
• scientific article; zbMATH DE number 1962767
• Gate circuits in the algebra of transients
• Gate circuits with feedback in finite multivalued algebras of transients
• scientific article; zbMATH DE number 2042609

Cited in

(6)

• Time-optimal short-circuit evaluation of Boolean expressions
• On the complexity of the evaluation of transient extensions of Boolean functions
• scientific article; zbMATH DE number 3868606 (Why is no real title available?)
• scientific article; zbMATH DE number 3503139 (Why is no real title available?)
• Event-driven traversal of logic circuits for re-evaluation of Boolean functions in reactive systems
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

This page was built for publication: On the complexity of the evaluation of transient extensions of Boolean functions

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