We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially the best result of this sort that can be proved using relativizable proof techniques.Technical report LCSR-TR-18
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
AbstractWe present an almost-everywhere complexity hierarchy for nondeterministic time, and show tha...
Abstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for c...
We prove the following theorem in this paper: For any real numbers r1, r2, 1≤r1<r2, there is a set A...
AbstractRelativized forms of deterministic and nondeterministic time complexity classes are consider...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
AbstractWe investigate the distribution of nonuniform complexities in uniform complexity classes. We...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractIn Descriptive Complexity, we investigate the use of logics to characterize computational co...
This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the compl...
. This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the com...
We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show t...
Nepomnjaščǐı’s Theorem states that for all 0 ≤ < 1 and k> 0 the class of languages recogn...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
AbstractWe present an almost-everywhere complexity hierarchy for nondeterministic time, and show tha...
Abstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for c...
We prove the following theorem in this paper: For any real numbers r1, r2, 1≤r1<r2, there is a set A...
AbstractRelativized forms of deterministic and nondeterministic time complexity classes are consider...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
AbstractWe investigate the distribution of nonuniform complexities in uniform complexity classes. We...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractIn Descriptive Complexity, we investigate the use of logics to characterize computational co...
This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the compl...
. This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the com...
We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show t...
Nepomnjaščǐı’s Theorem states that for all 0 ≤ < 1 and k> 0 the class of languages recogn...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
DOI
Add to ORKG