Complexity of Subcases of Presburger Arithmetic (Q3340842): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Complexity of Subcases of Presburger Arithmetic
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/1999283 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4249272358 / rank
 
Normal rank
Property / title
 
Complexity of Subcases of Presburger Arithmetic (English)
Property / title: Complexity of Subcases of Presburger Arithmetic (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Presburger arithmetic with bounded quantifier alternation depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities / rank
 
Normal rank

Latest revision as of 14:40, 14 June 2024

scientific article
Language Label Description Also known as
English
Complexity of Subcases of Presburger Arithmetic
scientific article

    Statements

    1984
    0 references
    complexity of decidable theories
    0 references
    lower bounds for lengths of formulas
    0 references
    Presburger arithmetic
    0 references
    0 references
    Complexity of Subcases of Presburger Arithmetic (English)
    0 references

    Identifiers

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