The Computational Complexity of Integer Programming with Alternations (Q5108263): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1287/moor.2018.0988 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966775917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational generating functions for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations. Structures for algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Algorithmic Geometry of Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of lattice points in a translated polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Hardness Results for Diophantine Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subclasses of Presburger arithmetic and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice translates of a polytope and the Frobenius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / 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: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of short Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY OF SHORT GENERATING FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Presburger arithmetic with fixed quantifier dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127409955 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/MOOR.2018.0988 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:57, 30 December 2024

scientific article; zbMATH DE number 7195319
Language Label Description Also known as
English
The Computational Complexity of Integer Programming with Alternations
scientific article; zbMATH DE number 7195319

    Statements

    The Computational Complexity of Integer Programming with Alternations (English)
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    programming
    0 references
    integer
    0 references
    theory
    0 references
    computational complexity
    0 references
    integer programming
    0 references
    alternations
    0 references
    projection of integer points
    0 references

    Identifiers

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