Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor |
scientific article; zbMATH DE number 1380614
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor |
scientific article; zbMATH DE number 1380614 |
Statements
19 December 1999
0 references
randomized polynomial time algorithm
0 references
0 references
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (English)
0 references
0.8873741
0 references
0.8860358
0 references
0.8836142
0 references
0.88079953
0 references
0.87611884
0 references
0.8761187
0 references
