A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
type: Item
instance of: scholarly article
title: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
zbMATH Open document ID: 0381.03021
DOI: 10.1016/0022-0000(78)90021-1
author: Derek C. Oppen
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 03C10
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 3591967
Wikidata QID: Q56059275
MaRDI profile type: Publication
full work available at URL: 0022-0000(78)90021-1
OpenAlex ID: W2008770192
cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations
cites work: Q5674430
cites work: Q4401928
cites work: Q4082296
DBLP publication ID: journals/jcss/Oppen78
description: scientific article; zbMATH DE number 3591967