Complexity of Presburger arithmetic with fixed quantifier dimension
Arbeitspapier
Faculties
Fakultät für Ingenieurwissenschaften und InformatikUlm serial
Ulmer Informatik-Berichte
Abstract
N/A
Date created
1995
Subject Headings
Berechnungskomplexität [GND]Presburger-Arithmetik [GND]
Computational complexity [LCSH]
Dewey Decimal Group
DDC 004 / Data processing & computer scienceMetadata
Show full item recordCitation example
Schöning, Uwe (2010): Complexity of Presburger arithmetic with fixed quantifier dimension. Open Access Repositorium der Universität Ulm. http://dx.doi.org/10.18725/OPARU-1685