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

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

Details and statistics

DOI: 10.2178/JSL/1185803628

access: closed

type: Journal Article

metadata version: 2017-05-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics