On exponential time lower bound of Knapsack under backtracking (Q964408): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q359777
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.12.004 / rank
Normal rank
 
Property / author
 
Property / author: Xin Li / rank
 
Normal rank
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.1016/j.tcs.2009.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057373223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a model for backtracking and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of priority algorithms for facility location and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Reflections on a Theory for Basic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples in exact phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for the subset-sum problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.12.004 / rank
 
Normal rank

Latest revision as of 10:15, 10 December 2024

scientific article
Language Label Description Also known as
English
On exponential time lower bound of Knapsack under backtracking
scientific article

    Statements

    On exponential time lower bound of Knapsack under backtracking (English)
    0 references
    0 references
    0 references
    15 April 2010
    0 references
    model of algorithms
    0 references
    pBT model
    0 references
    knapsack problem
    0 references
    exponential time lower bounds
    0 references
    backtracking
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references