Generic Complexity of Presburger Arithmetic

DOI10.1007/978-3-540-74510-5_36zbMath1188.03028OpenAlexW1659469762MaRDI QIDQ3499785

Alexander N. Rybalov

Publication date: 3 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_36

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

This page was built for publication: Generic Complexity of Presburger Arithmetic