Complexity of short Presburger arithmetic (Q4978025)

From MaRDI portal
Revision as of 21:06, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 6761857
Language Label Description Also known as
English
Complexity of short Presburger arithmetic
scientific article; zbMATH DE number 6761857

    Statements

    Complexity of short Presburger arithmetic (English)
    0 references
    0 references
    0 references
    17 August 2017
    0 references
    Barvinok's algorithm
    0 references
    Kannan's partition theorem
    0 references
    Presburger arithmetic
    0 references
    integer programming
    0 references

    Identifiers

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