An exponential gap with the removal of one negation gate (Q1603543): Difference between revisions

@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+The gap between monotone and non-monotone circuit complexity is exponential
+Normal rank
@@ Property / cites work @@
+On the Inversion Complexity of a System of Functions
+Normal rank
@@ Property / cites work @@
+Q4092993
@@ Property / cites work: Q4092993 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234108
@@ Property / cites work: Q4234108 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Negation-limited circuit complexity of symmetric functions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00264-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2053969720
@@ Property / OpenAlex ID: W2053969720 / rank @@
+Normal rank