Comparing the Expressibility of Languages Formed Using NP-Complete Operators (Q3358723): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1093/logcom/1.3.305 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1093/LOGCOM/1.3.305 / rank | |||
Normal rank | |||
Latest revision as of 03:15, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing the Expressibility of Languages Formed Using NP-Complete Operators |
scientific article |
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
