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

Cached

Download Links

by Miklos Ajtai , Ronald Fagin
Venue:Journal of Symbolic Logic
Citations:71 - 8 self