Comparing the Expressibility of Languages Formed Using NP-Complete Operators (Q3358723)
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 4210126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing the Expressibility of Languages Formed Using NP-Complete Operators |
scientific article; zbMATH DE number 4210126 |
Statements
Comparing the Expressibility of Languages Formed Using NP-Complete Operators (English)
0 references
1991
0 references
graph colouring
0 references
logical expressibility
0 references
NP-completeness
0 references
projection translations
0 references
finite model theory
0 references
complexity classes
0 references
first-order languages
0 references
0.7684376239776611
0 references
0.7484084367752075
0 references
0.7468501329421997
0 references
