Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)

Mikls Ajtai, Ronald Fagin

Browse the full FOCS paper archive.