NP search problems in low fragments of bounded arithmetic

Publisher: Cambridge University Press

E-ISSN: 1943-5886|72|2|649-672

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.72, Iss.2, 2007-06, pp. : 649-672

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