Add to ORKGSIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
AbstractThe intrinsic complexity of learning compares the difficulty of learning classes of objects ...
AbstractComplexity measures and provable recursive functions (p-functions) are combined to define a ...
10.1007/11672142_11Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...
In this tutorial paper we overview research being done in the field of structural complexity and rec...
It is proven that complexity classes of abstract measures of complexity need not be recursively enum...
10.1090/S0002-9947-2011-05306-7Transactions of the American Mathematical Society363105465-548
Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursion-the...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
These proceedings contain research and survey papers from many subfields of recursion theory, with e...
This paper studies possible extensions of the concept of complexity class of recursive functions to ...
TIB: RN 4237 (200) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...
A function is said to be computationally reducible to another if it requires less space(or a smaller...
During the last few years, unprecedented programs has been made in structural complexity theory; cla...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
AbstractThe intrinsic complexity of learning compares the difficulty of learning classes of objects ...
AbstractComplexity measures and provable recursive functions (p-functions) are combined to define a ...
10.1007/11672142_11Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...
In this tutorial paper we overview research being done in the field of structural complexity and rec...
It is proven that complexity classes of abstract measures of complexity need not be recursively enum...
10.1090/S0002-9947-2011-05306-7Transactions of the American Mathematical Society363105465-548
Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursion-the...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
These proceedings contain research and survey papers from many subfields of recursion theory, with e...
This paper studies possible extensions of the concept of complexity class of recursive functions to ...
TIB: RN 4237 (200) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...
A function is said to be computationally reducible to another if it requires less space(or a smaller...
During the last few years, unprecedented programs has been made in structural complexity theory; cla...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
AbstractThe intrinsic complexity of learning compares the difficulty of learning classes of objects ...
AbstractComplexity measures and provable recursive functions (p-functions) are combined to define a ...