Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations

Arnold Beckmann, Samuel R. Buss
  • De Gruyter
  • DOI: 10.1515/9783110324907.65

The authors haven't finished explaining this publication. If you are the author, sign in to claim or explain your work.

Read Publication

http://dx.doi.org/10.1515/9783110324907.65

The following have contributed to this page: Samuel R Buss

In partnership with: