NP Search Problems in Low Fragments of Bounded Arithmetic

NP Search Problems in Low Fragments of Bounded Arithmetic

Jan Krajíček, Alan Skelley and Neil Thapen
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
72
Language:
english
Journal:
The Journal of Symbolic Logic
DOI:
10.2307/27588561
Date:
June, 2007
File:
PDF, 2.03 MB
english, 2007
Conversion to is in progress
Conversion to is failed