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.
SIAM Journal on Computing , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
extension 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
extension 1polarities
extend 1representative citing papers
A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.
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.
-
Quantum algorithms for path and cycle containment problems
A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.