Abstract
Fischer and Rabin proved in [4] that Presburger Arithmetic has at least double exponential worse-case complexity. In [6] a theory of generic-case complexity was developed, where algorithmic problems are studied on “most” inputs instead of all set of inputs. An interesting question rises about existing of more efficient (say, polynomial) generic algorithm deciding Presburger Arithmetic on some “large” set of closed formulas. We prove, however, that there is no even exponential generic algorithm working correctly on arbitrary “very large” sets of inputs (so-called strongly generic sets).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing 13, 850–864 (1984)
Bogdanov, A., Trevisan, L.: Average-Case Complexity. Electronic Colloquium on Computational Complexity, Report No. 73 (2006)
Bogdanov, A., Trevisan, L.: On Worst-Case to Average-Case Reductions for NP Problems. In: Proceedings of 44th FOCS, pp. 308–317. IEEE, Los Alamitos (2003)
Fischer, M.J., Rabin, M.O.: Super-Exponential Complexity of Presburger Arithmetic. In: Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41 (1974)
Hamkins, J.D., Miasnikov, A.: The halting problem is decidable on a set of asymptotic probability one. Notre Dame Journal of Formal Logic 47(4), 515–524 (2006)
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory and random walks. J. Algebra 264(2), 665–694 (2003)
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Average-case complexity for the word and membership problems in group theory. Advances in Mathematics 190, 343–359 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rybalov, A.N. (2007). Generic Complexity of Presburger Arithmetic. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)