Proves the stronger rational-degree conjecture holds with polynomial bounds for monotone, unate, bounded-alternation, symmetric, k-uniform hypergraph, and read-k DNF total Boolean functions.
28th Annual Symposium on Foundations of Computer Science (
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Approximate Non-Deterministic Degree of Total Boolean Functions
Proves the stronger rational-degree conjecture holds with polynomial bounds for monotone, unate, bounded-alternation, symmetric, k-uniform hypergraph, and read-k DNF total Boolean functions.