A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56324083, #quickstatements; #temporary_batch_1711504555137 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating the Permanent / rank | |||
Normal rank | |||
Latest revision as of 15:24, 22 May 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
