Computing Boolean functions from multiple faulty copies of input bits (Q596147): Difference between revisions

@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / 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/j.tcs.2003.07.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2168377622
@@ Property / OpenAlex ID: W2168377622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Noise sensitivity of Boolean functions and applications to percolation
+Normal rank
@@ Property / cites work @@
+Sensitivity vs. block sensitivity (an average-case study)
+Normal rank
@@ Property / cites work @@
+Lower bounds for the complexity of reliable Boolean circuits with noisy gates
+Normal rank
@@ Property / cites work @@
+ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
+Normal rank
@@ Property / cites work @@
+CREW PRAM<scp>s</scp> and Decision Trees
@@ Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Invariance of complexity measures for networks with unreliable gates
+Normal rank
@@ Property / cites work @@
+Sensitivity vs. block sensitivity of Boolean functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:596147