Universal first-order logic is superfluous for NL, P, NP and coNP (Q5404481)
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 6272603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal first-order logic is superfluous for NL, P, NP and coNP |
scientific article; zbMATH DE number 6272603 |
Statements
Universal First-Order Logic is Superfluous for NL, P, NP and coNP (English)
0 references
24 March 2014
0 references
descriptive complexity
0 references
first-order projections
0 references
NP-completeness
0 references
problems and reductions
0 references
complexity classes
0 references
0.8180390000343323
0 references
0.7662865519523621
0 references
0.7259218692779541
0 references
0.7152377963066101
0 references
0.7138119339942932
0 references
