Computational Complexity of Probabilistic Turing Machines (Q4140967): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60305282, #quickstatements; #temporary_batch_1705500093209 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:42, 6 February 2024
scientific article; zbMATH DE number 3570423
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of Probabilistic Turing Machines |
scientific article; zbMATH DE number 3570423 |
Statements
Computational Complexity of Probabilistic Turing Machines (English)
0 references
1977
0 references
