The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(82)90115-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1992963060
@@ Property / OpenAlex ID: W1992963060 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of logical theories
@@ Property / cites work: The complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Positive Integral Solutions of Linear Diophantine Equations
+Normal rank
@@ Property / cites work @@
+A Decision Procedure for the First Order Theory of Real Addition with Order
+Normal rank
@@ Property / cites work @@
+Q4082296
@@ Property / cites work: Q4082296 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880807
@@ Property / cites work: Q3880807 / rank @@
+Normal rank
@@ Property / cites work @@
+A Bound on Solutions of Linear Integer Equalities and Inequalities
+Normal rank
@@ Property / cites work @@
+Q5772619
@@ Property / cites work: Q5772619 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4110999
@@ Property / cites work: Q4110999 / rank @@
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic with bounded quantifier alternation
+Normal rank
@@ Property / cites work @@
+Theory of Formal Systems. (AM-47)
@@ Property / cites work: Theory of Formal Systems. (AM-47) / rank @@
+Normal rank