An arithmetic model of computation equivalent to threshold circuits (Q1186610): Difference between revisions

@@ Property / cites work @@
+Log Depth Circuits for Division and Related Problems
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q4044675
@@ Property / cites work: Q4044675 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5690468
@@ Property / cites work: Q5690468 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5655273
@@ Property / cites work: Q5655273 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+The computational efficacy of finite-field arithmetic
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(92)90335-d
+Normal rank
@@ Property / OpenAlex ID @@
+W2077942962
@@ Property / OpenAlex ID: W2077942962 / rank @@
+Normal rank