A lower bound on the number of additions in monotone computations (Q1232179): Difference between revisions

@@ Property / author @@
-Claus Peter Schnorr
@@ Property / author: Claus Peter Schnorr / rank @@
-Normal rank
@@ Property / author @@
+Claus Peter Schnorr
@@ Property / author: Claus Peter Schnorr / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(76)90083-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2020346765
@@ Property / OpenAlex ID: W2020346765 / 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 @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of monotone networks for Boolean matrix product
+Normal rank
@@ Property / cites work @@
+The network complexity and the Turing machine complexity of finite functions
+Normal rank
@@ Property / cites work @@
+A lower bound on the number of additions in monotone computations
+Normal rank