On the Probabilistic Degree of an $n$-variate Boolean Function

Srikanth Srinivasan 0001, S. Venkitesh. On the Probabilistic Degree of an $n$-variate Boolean Function. Electronic Colloquium on Computational Complexity (ECCC), 28:98, 2021. [doi]

@article{SrinivasanV21-0,
  title = {On the Probabilistic Degree of an $n$-variate Boolean Function},
  author = {Srikanth Srinivasan 0001 and S. Venkitesh},
  year = {2021},
  url = {https://eccc.weizmann.ac.il/report/2021/098},
  researchr = {https://researchr.org/publication/SrinivasanV21-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {28},
  pages = {98},
}