arXiv (All)
open access
Rational degree is polynomially related to degree
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A geometric characterization of unbounded integer cubic optimization problems via thin rays#1050782
- Reducibility of $rx^m+p^e f(x)$ for Large Primes $p$#1077522
- A density deficit for sums of three cube-full numbers#1130614
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#780921
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#779546
Record · ID 1129156
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive