Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (Q4337649): 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.1137/s0097539794261970 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072727451 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 2024
scientific article; zbMATH DE number 1012886
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets |
scientific article; zbMATH DE number 1012886 |
Statements
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (English)
0 references
26 May 1997
0 references
unambiguous computation
0 references
Boolean hierarchy
0 references
sparse Turing-complete sets
0 references
