A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56324083, #quickstatements; #temporary_batch_1711504555137 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56324083 / rank | |||
Normal rank | |||
Revision as of 04:08, 27 March 2024
scientific article; zbMATH DE number 559233
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem |
scientific article; zbMATH DE number 559233 |
Statements
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (English)
0 references
28 April 1994
0 references
randomized algorithm
0 references
multidimensional knapsack problem
0 references
Markov chain
0 references
