Average-Case Lower Bounds for Noisy Boolean Decision Trees (Q4210156): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4141118
@@ Property / cites work: Q4141118 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing with Noisy Information
@@ Property / cites work: Computing with Noisy Information / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230354
@@ Property / cites work: Q4230354 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the complexity of reliable Boolean circuits with noisy gates
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/s0097539796310102
+Normal rank
@@ Property / OpenAlex ID @@
+W1963494112
@@ Property / OpenAlex ID: W1963494112 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4210156