The Necessity of Closed Circuit Loops in Minimal Combinational Circuits
IEEE Transactions on Computers
Formal Reasoning About Causality Analysis
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
The analysis of cyclic circuits with Boolean satisfiability
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Discrete Applied Mathematics
Hi-index | 14.98 |
We present a specific n-input 2n-output positive unate Boolean function which can be realized with 2n two-input gates if feedback is used, but which requires 3n-2 gates if feedback is not used.