The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple counter machines and number-theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP-complete number-theoretic problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of semilinear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank

Latest revision as of 10:32, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of the equivalence problem for two characterizations of Presburger sets
scientific article

    Statements

    The complexity of the equivalence problem for two characterizations of Presburger sets (English)
    0 references
    0 references
    0 references
    1981
    0 references
    Presburger formulas
    0 references
    reversal-bounded multicounter machines
    0 references
    upper bound
    0 references
    deterministic time complexity
    0 references
    inequivalence problem
    0 references
    semilinear sets
    0 references
    Presburger relations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references