Presburger arithmetic (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Presburger arithmetic" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

3arxiv.org

69^th place

59^th place

1uu.nl

2,467^th place

2,049^th place

1tum.edu

low place

1fit.edu

low place

1escholarship.org

1,523^rd place

976^th place

1ucla.edu

782^nd place

585^th place

1harvard.edu

18^th place

17^th place

arxiv.org

Haase 2014, pp. 47:1-47:10. Haase, Christoph (2014). "Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy". Proceedings CSL-LICS. ACM. pp. 47:1–47:10. arXiv:1401.5266. doi:10.1145/2603088.2603092.
Nguyen & Pak 2017. Nguyen, Danny; Pak, Igor (2017). "Short Presburger Arithmetic is Hard" (PDF). 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). pp. 37–48. arXiv:1708.08179. doi:10.1109/FOCS.2017.13. ISBN 978-1-5386-3464-6. S2CID 3425421. Retrieved 2022-09-04.
Eisenbrand & Shmonin 2008. Eisenbrand, Friedrich; Shmonin, Gennady (2008). "Parametric Integer Programming in Fixed Dimension". Mathematics of Operations Research. 33 (4): 839–850. arXiv:0801.4336. doi:10.1287/moor.1080.0320. S2CID 15698556.

doi.org

Nipkow 2010. Nipkow, T (2010). "Linear Quantifier Elimination" (PDF). Journal of Automated Reasoning. 45 (2): 189–212. doi:10.1007/s10817-010-9183-0. S2CID 14279141.
Haase 2014, pp. 47:1-47:10. Haase, Christoph (2014). "Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy". Proceedings CSL-LICS. ACM. pp. 47:1–47:10. arXiv:1401.5266. doi:10.1145/2603088.2603092.
Nguyen & Pak 2017. Nguyen, Danny; Pak, Igor (2017). "Short Presburger Arithmetic is Hard" (PDF). 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). pp. 37–48. arXiv:1708.08179. doi:10.1109/FOCS.2017.13. ISBN 978-1-5386-3464-6. S2CID 3425421. Retrieved 2022-09-04.
Eisenbrand & Shmonin 2008. Eisenbrand, Friedrich; Shmonin, Gennady (2008). "Parametric Integer Programming in Fixed Dimension". Mathematics of Operations Research. 33 (4): 839–850. arXiv:0801.4336. doi:10.1287/moor.1080.0320. S2CID 15698556.
King, Barrett & Tinelli 2014. King, Tim; Barrett, Clark W.; Tinelli, Cesare (2014). "Leveraging linear and mixed integer programming for SMT". 2014 Formal Methods in Computer-Aided Design (FMCAD). Vol. 2014. pp. 139–146. doi:10.1109/FMCAD.2014.6987606. ISBN 978-0-9835-6784-4. S2CID 5542629.
Ginsburg & Spanier 1966, pp. 285–296. Ginsburg, Seymour; Spanier, Edwin Henry (1966). "Semigroups, Presburger Formulas, and Languages". Pacific Journal of Mathematics. 16 (2): 285–296. doi:10.2140/pjm.1966.16.285.
Cobham 1969, pp. 186–192. Cobham, Alan (1969). "On the base-dependence of sets of numbers recognizable by finite automata". Math. Systems Theory. 3 (2): 186–192. doi:10.1007/BF01746527. S2CID 19792434.
Semenov 1977, pp. 403–418. Semenov, A.L. (1977). "Presburgerness of predicates regular in two number systems". Sibirsk. Mat. Zh. (in Russian). 18 (2): 403–418. Bibcode:1977SibMJ..18..289S. doi:10.1007/BF00967164.
Michaux & Villemaire 1996, pp. 251–277. Michaux, Christian; Villemaire, Roger (1996). "Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems". Annals of Pure and Applied Logic. 77 (3): 251–277. doi:10.1016/0168-0072(95)00022-4.
Muchnik 2003, pp. 1433–1444. Muchnik, Andrei A. (2003). "The definable criterion for definability in Presburger arithmetic and its applications". Theor. Comput. Sci. 290 (3): 1433–1444. doi:10.1016/S0304-3975(02)00047-6.

escholarship.org

Nguyen Luu 2018, chapter 3. Nguyen Luu, Dahn (2018). The Computational Complexity of Presburger Arithmetic (Thesis). Los Angeles: UCLA Electronic Theses and Dissertations. Retrieved 2022-09-08.

fit.edu

cs.fit.edu

Stansifer 1984. Stansifer, Ryan (Sep 1984). Presburger's Article on Integer Arithmetic: Remarks and Translation (PDF) (Technical Report). Vol. TR84-639. Ithaca/NY: Dept. of Computer Science, Cornell University.

harvard.edu

ui.adsabs.harvard.edu

Semenov 1977, pp. 403–418. Semenov, A.L. (1977). "Presburgerness of predicates regular in two number systems". Sibirsk. Mat. Zh. (in Russian). 18 (2): 403–418. Bibcode:1977SibMJ..18..289S. doi:10.1007/BF00967164.

semanticscholar.org

api.semanticscholar.org

Nipkow 2010. Nipkow, T (2010). "Linear Quantifier Elimination" (PDF). Journal of Automated Reasoning. 45 (2): 189–212. doi:10.1007/s10817-010-9183-0. S2CID 14279141.
Nguyen & Pak 2017. Nguyen, Danny; Pak, Igor (2017). "Short Presburger Arithmetic is Hard" (PDF). 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). pp. 37–48. arXiv:1708.08179. doi:10.1109/FOCS.2017.13. ISBN 978-1-5386-3464-6. S2CID 3425421. Retrieved 2022-09-04.
Eisenbrand & Shmonin 2008. Eisenbrand, Friedrich; Shmonin, Gennady (2008). "Parametric Integer Programming in Fixed Dimension". Mathematics of Operations Research. 33 (4): 839–850. arXiv:0801.4336. doi:10.1287/moor.1080.0320. S2CID 15698556.
King, Barrett & Tinelli 2014. King, Tim; Barrett, Clark W.; Tinelli, Cesare (2014). "Leveraging linear and mixed integer programming for SMT". 2014 Formal Methods in Computer-Aided Design (FMCAD). Vol. 2014. pp. 139–146. doi:10.1109/FMCAD.2014.6987606. ISBN 978-0-9835-6784-4. S2CID 5542629.
Cobham 1969, pp. 186–192. Cobham, Alan (1969). "On the base-dependence of sets of numbers recognizable by finite automata". Math. Systems Theory. 3 (2): 186–192. doi:10.1007/BF01746527. S2CID 19792434.

tum.edu

www4.cs.tum.edu

Nipkow 2010. Nipkow, T (2010). "Linear Quantifier Elimination" (PDF). Journal of Automated Reasoning. 45 (2): 189–212. doi:10.1007/s10817-010-9183-0. S2CID 14279141.

ucla.edu

math.ucla.edu

Nguyen & Pak 2017. Nguyen, Danny; Pak, Igor (2017). "Short Presburger Arithmetic is Hard" (PDF). 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). pp. 37–48. arXiv:1708.08179. doi:10.1109/FOCS.2017.13. ISBN 978-1-5386-3464-6. S2CID 3425421. Retrieved 2022-09-04.

uu.nl

studenttheses.uu.nl

Zoethout 2015, p. 8, Theorem 1.2.4.. Zoethout, Jetze (February 1, 2015). Interpretations in Presburger Arithmetic (Bachelor Thesis) (PDF) (Thesis). Retrieved 2023-08-25.