"Positive Turing and Truth-Table Completeness for NEXP Are Incomparable."

Levke Bentzien (1998)

Details and statistics

DOI: 10.1007/BFB0055797

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics