Name
Abstract | ||
|---|---|---|
The probabilistic degree of a Boolean function f : {0, 1}(n) -> {0, 1} is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability. Introduced by Razborov [Mat. Zametki, 41 (1987), pp. 598-607], upper and lower bounds on probabilistic degrees of Boolean functions-specifically symmetric Boolean functions-have been used to prove explicit lower bounds, design pseudorandom generators, and devise algorithms for combinatorial problems. In this paper, we characterize the probabilistic degrees of all symmetric Boolean functions up to polylogarithmic factors over all fields of fixed characteristic (positive or zero). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1137/19M1294162 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
probabilistic degree, symmetric Boolean function, computational complexity | Journal | 35 |
Issue | ISSN | Citations |
3 | 0895-4801 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Srikanth Srinivasan | 1 | 132 | 21.31 |
| Utkarsh Tripathi | 2 | 1 | 3.05 |
| S. Venkitesh | 3 | 1 | 3.05 |