Near-Linear Lower Bounds for Testing Directed Acyclicity
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity
- Quantum Property Testing for Bounded-Degree Directed Graphs
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time