A Note on the Complexity of the Reachability Problem for Tournaments

Till Tantau. A Note on the Complexity of the Reachability Problem for Tournaments. Electronic Colloquium on Computational Complexity (ECCC), (092), 2001. [doi]

Abstract

Abstract is missing.