On relationships between approximate and probabilistic complexity classes (Q1326985)
From MaRDI portal
!
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 589840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On relationships between approximate and probabilistic complexity classes |
scientific article; zbMATH DE number 589840 |
Statements
On relationships between approximate and probabilistic complexity classes (English)
0 references
15 June 1994
0 references
exponential-time approximation algorithms
0 references
0.7360205054283142
0 references
