Computational complexity of controllability/observability problems for combinational circuits

DOI10.1109/12.53597zbMATH Open1395.94393OpenAlexW2180619841MaRDI QIDQ5375445FDOQ5375445

Authors: Hideo Fujiwara 

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.53597

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Observability (93B07)

Cited In (2)

• Studying the controllabiity of combinational circuits
• Efficient computation of arbitrary control dependencies

This page was built for publication: Computational complexity of controllability/observability problems for combinational circuits

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