ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS

DOI10.1142/S0129054112400023zbMath1246.68116OpenAlexW2963489396MaRDI QIDQ2909178

Yuli Ye, Baiyu Li, Janusz A. 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

zbMATH Keywords

complexityevaluationcircuitBoolean functionalgebratransientgatehazardmulti-valuedtransient extension

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Hazard algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS