Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1484072583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transition and finite-size scaling for the integer partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of an NP-complete problem: subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number partitioning as a random energy model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new enumeration scheme for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving dense subset-sum problems by using analytical number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank

Latest revision as of 12:18, 28 June 2024

scientific article
Language Label Description Also known as
English
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
scientific article

    Statements

    Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (English)
    0 references
    0 references
    0 references
    19 June 2008
    0 references
    0 references
    0 references