Publication:4237287

From MaRDI portal

Revision as of 17:01, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

zbMath0924.03049MaRDI QIDQ4237287

Thomas Quintus

Publication date: 5 April 1999

zbMATH Keywords

complexity theory; finite model theory; descriptive complexity theory; reducibilities; Lindström quantifier; oracle Turing machines; relativized model of computation; oracle sets; capturing of relativized complexity classes

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03D15: Complexity of computation (including implicit computational complexity)

03C13: Model theory of finite structures

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D30: Other degrees and reducibilities in computability and recursion theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4237287&oldid=18129571"