Alternation and the computational complexity of logic programs (Q3702512): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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.1016/0743-1066(84)90021-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058419440 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternation and the computational complexity of logic programs |
scientific article |
Statements
Alternation and the computational complexity of logic programs (English)
0 references
1984
0 references
logic program
0 references
tree proof
0 references
complexity measures
0 references
goal-size
0 references
length
0 references
depth
0 references
alternating Turing machine
0 references
