An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability

Rahul Jain, Raghunath Tewari. An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. In Arkadev Chattopadhyay, Paul Gastin, editors, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India. Volume 150 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.