论文信息 - NP-completeness of Minimum Binary Decision Diagram Identification Problems - 字舞流文

NP-completeness of Minimum Binary Decision Diagram Identification Problems

Yasuhiko Takenaga | Shuzo Yajima

[1] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.

[2] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[3] Randal E. Bryant,et al. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.

[4] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.

[5] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.

[6] Chen-Shang Lin,et al. On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.

[7] Nagisa Ishiura,et al. A Class of Logic Functions Expressible by Polynomial-Size Binary Decision Diagrams , 1991 .