Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR26-005 | 9th April 2026 06:32

Rational degree is polynomially related to degree

RSS-Feed




Revision #1
Authors: Robin Kothari, Matt Kovacs-Deak, Daochen Wang, Rain Zimin Yang
Accepted on: 9th April 2026 06:32
Downloads: 4
Keywords: 


Abstract:

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ 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.



Changes to previous version:

26 pages; v2: added an author, improved main result


Paper:

TR26-005 | 13th January 2026 18:27

Rational degree is polynomially related to degree


Abstract:

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.



ISSN 1433-8092 | Imprint