1. Polynomial formal verification: Ensuring correctness under resource constraints;drechsler;Int'l Conf on CAD,2022
2. Branching Programs and Binary Decision Diagrams - Theory and Application;wegener;SIAM Monographs on Discrete Mathematics and Applications,2000
3. Why is ATPG easy?;prasad;Design Automation Conf,1999
4. Computational complexity of controllability/observability problems for combinational circuits
5. Synthesis for testability: Binary decision diagrams;becker;LNCS Symp on Theoretical Aspects of Comp Science,1992