On the complexity of the evaluation of transient extensions of Boolean functions
From MaRDI portal
Publication:2909178
DOI10.1142/S0129054112400023zbMATH Open1246.68116OpenAlexW2963489396MaRDI QIDQ2909178FDOQ2909178
Authors: Baiyu Li, Yuli Ye, Janusz Brzozowski 
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112400023
Recommendations
- On the complexity of the evaluation of transient extensions of Boolean functions
- scientific article
- On the complexity of restrictions of Boolean functions
- On estimates on the complexity of restrictions of Boolean functions
- Complexity lower bound for Boolean functions in the class of extended operator forms
- On complexity of a particular Boolean functions class
- On the multiplicative complexity of Boolean functions
- Complexity of sequential implementation of partial Boolean functions
- Complexity bounds on program realizations of Boolean functions specified in various forms
- On the complexity of realization of Boolean functions by formulas
evaluationcomplexitytransientalgebraBoolean functioncircuitgatehazardmulti-valuedtransient extension
Cites Work
Cited In (5)
- Time-optimal short-circuit evaluation of Boolean expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Event-driven traversal of logic circuits for re-evaluation of Boolean functions in reactive systems
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 Q2909178)
