Comparing the Expressibility of Languages Formed Using NP-Complete Operators (Q3358723): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/logcom/1.3.305 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121714568 / rank | |||
Normal rank | |||
Revision as of 00:03, 20 March 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
