Lower bounds for resolution and cutting plane proofs and monotone computations

Publisher: Cambridge University Press

E-ISSN: 1943-5886|62|3|981-998

ISSN: 0022-4812

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

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