The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.
Circuit lower bounds for nondeterministic quasi-polytime: An easy witness lemma for NP and NQP
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
The 2D HLF problem lies in QNC^0 but not in AC^0, with an exponential average-case correlation lower bound against AC^0 circuits.
citing papers explorer
-
Revisiting Diameter in Directed Graphs
The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.
-
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
The 2D HLF problem lies in QNC^0 but not in AC^0, with an exponential average-case correlation lower bound against AC^0 circuits.