Complexity of Presburger arithmetic with fixed quantifier dimension
type: Item
instance of: scholarly article
title: Complexity of Presburger arithmetic with fixed quantifier dimension
zbMATH Open document ID: 0872.68048
DOI: 10.1007/BF02679468
published in: Theory of Computing Systems
publication date: 1997-10-19T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1040696
zbMATH Keywords: Presburger arithmetic
author: Uwe Schöning
MaRDI profile type: Publication
cites work: The complexity of logical theories
cites work: Q3619797
cites work: The computational complexity of logical theories
cites work: Q4082296
cites work: The complexity of Presburger arithmetic with bounded quantifier alternation depth
cites work: Q4198056
cites work: Integer Programming with a Fixed Number of Variables
cites work: Q4298260
cites work: Presburger arithmetic with bounded quantifier alternation
cites work: Complexity of Subcases of Presburger Arithmetic
cites work: The polynomial-time hierarchy
cites work: Complete sets and the polynomial-time hierarchy
description: scientific article; zbMATH DE number 1040696