Counting the solutions of Presburger equations without enumerating them. (Q1426156): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2052987729
@@ Property / OpenAlex ID: W2052987729 / rank @@
+Normal rank
@@ Property / cites work @@
+Diophantine equations, Presburger arithmetic and finite automata
+Normal rank
@@ Property / cites work @@
+Logic and \(p\)-recognizable sets of integers
@@ Property / cites work: Logic and \(p\)-recognizable sets of integers / rank @@
+Normal rank
@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+Proving safety properties of infinite state systems by compilation into Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Handling infinite temporal data
@@ Property / cites work: Handling infinite temporal data / rank @@
+Normal rank
@@ Property / cites work @@
+Location, scheduling, design and integer programming
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Presburgerness of predicates regular in two number systems
+Normal rank
@@ Property / cites work @@
+Q4518891
@@ Property / cites work: Q4518891 / rank @@
+Normal rank