Negative thinking in branch-and-bound: the case of unate covering
暂无分享,去创建一个
Tiziano Villa | Robert K. Brayton | Alberto L. Sangiovanni-Vincentelli | Luca P. Carloni | Eugene Goldberg | R. Brayton | A. Sangiovanni-Vincentelli | L. Carloni | T. Villa | E. Goldberg
[1] Srinivas Devadas,et al. Solving Covering Problems Using LPR-based Lower Bounds , 1997, Proceedings of the 34th Design Automation Conference.
[2] Tiziano Villa,et al. Synthesis of FSMs: functional optimization , 1997 .
[3] Tiziano Villa,et al. Synthesis of FSMs: logic optimization , 1997 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[6] Olivier Coudert,et al. New Ideas for Solving Covering Problems , 1995, 32nd Design Automation Conference.
[7] Olivier Coudert,et al. Two-level logic minimization: an overview , 1994, Integr..
[8] Ieee Circuits,et al. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems , 1999, VLSI.
[10] Srinivas Devadas,et al. Solving covering problems using LPR-based lower bounds , 2000, IEEE Trans. Very Large Scale Integr. Syst..
[11] Tiziano Villa,et al. Negative thinking by incremental problem solving: application to unate covering , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[12] Alberto L. Sangiovanni-Vincentelli,et al. Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[13] Olivier Coudert,et al. On solving covering problems , 1996, DAC '96.