Functions Definable by Arithmetic Circuits (Q3576073): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03073-4_42
+Normal rank
@@ Property / OpenAlex ID @@
+W1571692614
@@ Property / OpenAlex ID: W1571692614 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence Problems for Circuits over Sets of Natural Numbers
+Normal rank
@@ Property / cites work @@
+Satisfiability of Algebraic Circuits over Sets of Natural Numbers
+Normal rank
@@ Property / cites work @@
+The bounded arithmetic hierarchy
@@ Property / cites work: The bounded arithmetic hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On the Recognition of Primes by Automata
@@ Property / cites work: On the Recognition of Primes by Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4910734
@@ Property / cites work: Q4910734 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Completeness of Equations over Sets of Natural Numbers
+Normal rank
@@ Property / cites work @@
+Q4418682
@@ Property / cites work: Q4418682 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of membership problems for circuits over sets of natural numbers
+Normal rank
@@ Property / cites work @@
+Classes of Predictably Computable Functions
@@ Property / cites work: Classes of Predictably Computable Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of membership problems for circuits over sets of integers
+Normal rank