On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
Property / cites work
 
Property / cites work: On Integer Programming and the Branch-Width of the Constraint Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intractability of permuting a block code to minimize trellis complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithm for path-width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963441955 / rank
 
Normal rank
Property / title
 
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English)
Property / title: On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English) / rank
 
Normal rank

Latest revision as of 10:25, 30 July 2024

scientific article; zbMATH DE number 7378701
Language Label Description Also known as
English
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
scientific article; zbMATH DE number 7378701

    Statements

    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    integer programming
    0 references
    strong exponential time hypothesis
    0 references
    branch-width of a matrix
    0 references
    fine-grained complexity
    0 references
    On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English)
    0 references

    Identifiers

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