Complexity of Presburger Arithmetic With Fixed Quantifier Dimension

Theory of Computing Systems - United States
doi 10.1007/bf02679468
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Complexity of Subcases of Presburger Arithmetic

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1984English

TaPAS: The Talence Presburger Arithmetic Suite

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Interval Arithmetic With Fixed Rounding Mode

Nonlinear Theory and Its Applications, IEICE
2016English

Conversion From Arithmetic to Boolean Masking With Logarithmic Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Finite-State Dimension and Real Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Molecular Complexity Calculated by Fractal Dimension

Scientific Reports
Multidisciplinary
2019English

The Arithmetical Complexity of Dimension and Randomness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Dimensional Regularization vs Methods in Fixed Dimension With and Without Γ5

Journal of High Energy Physics
High Energy PhysicsNuclear
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy