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]

Authors

Anant Dhayal

This author has not been identified. Look up 'Anant Dhayal' in Google

Jayalal Sarma

This author has not been identified. Look up 'Jayalal Sarma' in Google

Saurabh Sawlani

This author has not been identified. Look up 'Saurabh Sawlani' in Google