2 citations · 2 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
Finite Bases with Respect to the Superposition in Classes of Elementary Recursive Functions, dissertation
Sergey Volkov
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set…
cs.CC2008
Improved Monotone Circuit Depth Upper Bound for Directed Graph Reachability
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…