P ≠ NP ∩ co-NP for Infinite Time Turing Machines (Q3374094)
From MaRDI portal
!
WARNING
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 5010474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | P ≠ NP ∩ co-NP for Infinite Time Turing Machines |
scientific article; zbMATH DE number 5010474 |
Statements
P ≠ NP ∩ co-NP for Infinite Time Turing Machines (English)
0 references
9 March 2006
0 references
complexity theory
0 references
descriptive set theory
0 references
0.9600429
0 references
0 references
0.8340349
0 references
0.8339365
0 references
0.8333606
0 references
0.8309381
0 references
0 references
0.82893765
0 references
