Presburger-Arithmetik (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Presburger-Arithmetik" in German language version.

refsWebsite

Global rank German rank

2^nd place

3^rd place

415^th place

779^th place

doi.org

Derek C. Oppen: A 2^{2^{2^pn}} Upper Bound on the Complexity of Presburger Arithmetic. In: J. Comput. Syst. Sci. Band 16, Nr. 3, 1978, S. 323–332, doi:10.1016/0022-0000(78)90021-1.
Greg Nelson, Derek C. Oppen: A simplifier based on efficient decision algorithms. In: Proc. 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. April 1978, S. 141–150, doi:10.1145/512760.512775.

mit.edu

lcs.mit.edu

Michael J. Fischer, Michael O. Rabin: Super-Exponential Complexity of Presburger Arithmetic. In: Proceedings of the SIAM-AMS Symposium in Applied Mathematics. Band 7, 1974, S. 27–41 (mit.edu [PostScript; abgerufen am 26. Februar 2012]).