Satisfiability of Algebraic Circuits over Sets of Natural Numbers (Q5458839): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77050-3_21
+Normal rank
@@ Property / OpenAlex ID @@
+W2240617993
@@ Property / OpenAlex ID: W2240617993 / rank @@
+Normal rank
@@ Property / cites work @@
+PRIMES is in P
@@ Property / cites work: PRIMES is in P / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+The decision problem for exponential diophantine equations
+Normal rank
@@ Property / cites work @@
+Equivalence Problems for Circuits over Sets of Natural Numbers
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5613949
@@ Property / cites work: Q5613949 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418682
@@ Property / cites work: Q4418682 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340148
@@ Property / cites work: Q3340148 / rank @@
+Normal rank