"NP search problems in low fragments of bounded arithmetic."

Jan Krajícek, Alan Skelley, Neil Thapen (2007)

> Home

Details and statistics

DOI: 10.2178/JSL/1185803628

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/KrajicekST07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/KrajicekST07
Jan Krajícek, Alan Skelley, Neil Thapen:
NP search problems in low fragments of bounded arithmetic. J. Symb. Log. 72(2): 649-672 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.