Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: REDLOG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1851760673 / 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: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / 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: The complexity of almost linear diophantine problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak quantifier elimination for the full linear theory of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Integer Quantifier Elimination Beyond the Linear Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Databases and Information Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Boolean algebra with Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification of quantifier-free formulae over ordered fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of linear problems in fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Linear Quantifier Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier elimination for real algebra -- the quadratic case and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear problems in valued fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation and optimization by quantifier elimination / rank
 
Normal rank

Latest revision as of 03:13, 2 July 2024

scientific article
Language Label Description Also known as
English
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
scientific article

    Statements

    Effective Quantifier Elimination for Presburger Arithmetic with Infinity (English)
    0 references
    0 references
    0 references
    10 November 2009
    0 references

    Identifiers

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