Complexity of Subcases of Presburger Arithmetic (Q3340842): Difference between revisions

@@ Property / cites work @@
+NP-complete decision problems for binary quadratics
+Normal rank
@@ Property / cites work @@
+Q5674430
@@ Property / cites work: Q5674430 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of Presburger arithmetic with bounded quantifier alternation depth
+Normal rank
@@ Property / cites work @@
+Q4082296
@@ Property / cites work: Q4082296 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4163519
@@ Property / cites work: Q4163519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4110999
@@ Property / cites work: Q4110999 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585368
@@ Property / cites work: Q5585368 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4063432
@@ Property / cites work: Q4063432 / rank @@
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic with bounded quantifier alternation
+Normal rank
@@ Property / cites work @@
+Q4109684
@@ Property / cites work: Q4109684 / rank @@
+Normal rank
@@ Property / cites work @@
+A Bound on Solutions of Linear Integer Equalities and Inequalities
+Normal rank