2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Sergey Volkov
We prove that the directed graph reachability problem (transitive closure) can be solved by monotone fan-in 2 boolean circuits of depth (1/2+o(1))(log n)^2, where n is the number o…