Rational degree is polynomially related to degree
By: Matt Kovacs-Deak, Daochen Wang, Rain Zimin Yang
We prove that $\mathrm{deg}(f) \leq 2 \, \mathrm{rdeg}(f)^4$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three open problems stated by Nisan and Szegedy, and attributed to Fortnow, in 1994.
Similar Papers
Debordering Closure Results in Determinantal and Pfaffian Ideals
Computational Complexity
Makes math problems easier for computers to solve.
Debordering Closure Results in Determinantal and Pfaffian Ideals
Computational Complexity
Makes math problems easier for computers to solve.
VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
Combinatorics
Limits how complex computer programs can be.