Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437): Difference between revisions

@@ Property / cites work @@
+Q4385519
@@ Property / cites work: Q4385519 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the complexity of reliable Boolean circuits with noisy gates
+Normal rank
@@ Property / cites work @@
+Majority gates vs. general weighted threshold gates
+Normal rank
@@ Property / cites work @@
+Simulating threshold circuits by majority circuits
+Normal rank
@@ Property / cites work @@
+Threshold circuits of bounded depth
@@ Property / cites work: Threshold circuits of bounded depth / rank @@
+Normal rank
@@ Property / cites work @@
+Invariance of complexity measures for networks with unreliable gates
+Normal rank
@@ Property / cites work @@
+Area efficient methods to increase the reliability of combinatorial circuits
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank