Lower bounds for cutting planes proofs with small coefficients

E-ISSN： 1943-5886|62|3|708-728

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.62, Iss.3, 1997-09, pp. : 708-728

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Lower bounds for resolution and cutting plane proofs and monotone computations

The Journal of Symbolic Logic, Vol. 62, Iss. 3, 1997-09 ,pp. : 981-998

Cambridge University Press

Access to resources Recommend Favorite

Lower bounds to the size of constant-depth propositional proofs

The Journal of Symbolic Logic, Vol. 59, Iss. 1, 1994-03 ,pp. : 73-86

Cambridge University Press

Access to resources Recommend Favorite

Lower bounds for the norms of projections with small kernels

Bulletin of the Australian Mathematical Society, Vol. 45, Iss. 3, 1992-06 ,pp. : 507-511

Cambridge University Press

Access to resources Recommend Favorite

Lower bounds for tau coefficients and operator norms using composite matrix norms

Bulletin of the Australian Mathematical Society, Vol. 35, Iss. 1, 1987-02 ,pp. : 49-57

Cambridge University Press

Access to resources Recommend Favorite

Complexity bounds on proofs

The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. : 255-258

Cambridge University Press

Access to resources Recommend Favorite