Reachability is harder for directed than for undirected finite graphs (1990)

by M Ajtai, R Fagin
Venue:Journal of Symbolic Logic 55.1