Descriptive characterizations of computational complexity (Q1123616)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptive characterizations of computational complexity |
scientific article; zbMATH DE number 4110109 |
Statements
Descriptive characterizations of computational complexity (English)
0 references
1989
0 references
Several complexity classes, such as Nlog-Space, P-Time, P-Space, and Exp- Time are characterized in terms of formulas of the form (\(\forall\) relations) (\(\exists\) objects) \(\phi\) with \(\phi\) quantifier-free. Different syntactic variants of such formulas characterize different complexity classes. In particular, such descriptive characterizations in terms of higher order logical formulas are considered.
0 references
descriptive complexity
0 references
logical characterization
0 references
of complexity classes
0 references
0.8171651363372803
0 references
0.8163586258888245
0 references
