Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space

Anant Dhayal, Jayalal Sarma, Saurabh Sawlani. Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. In Venkatesh Raman, S. P. Suresh, editors, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India. Volume 29 of LIPIcs, pages 597-609, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

Abstract

Abstract is missing.