A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions

@@ Property / Wikidata QID @@
+Q56059275
@@ Property / Wikidata QID: Q56059275 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(78)90021-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2008770192
@@ Property / OpenAlex ID: W2008770192 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Positive Integral Solutions of Linear Diophantine Equations
+Normal rank
@@ Property / cites work @@
+Q5674430
@@ Property / cites work: Q5674430 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401928
@@ Property / cites work: Q4401928 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4082296
@@ Property / cites work: Q4082296 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jcss/Oppen78
@@ Property / DBLP publication ID: journals/jcss/Oppen78 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1247317