On Chvatal Rank and Cutting Planes Proofs
暂无分享,去创建一个
[1] Robert Moll,et al. Examples of hard tautologies in the propositional calculus , 1981, STOC '81.
[2] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[3] Maria Luisa Bonet,et al. On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems , 2000, SIAM J. Comput..
[4] Toniann Pitassi,et al. Rank bounds and integrality gaps for cutting planes procedures , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[5] C. Burdet,et al. On cutting planes , 1973 .
[6] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..
[7] Dima Grigoriev,et al. Complexity of Semi-algebraic Proofs , 2002, STACS.
[8] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.
[9] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[10] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[11] William J. Cook,et al. On cutting-plane proofs in combinatorial optimization , 1989 .
[12] Audra E. Kosh,et al. Linear Algebra and its Applications , 1992 .
[13] Jan Kra,et al. Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .
[14] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..