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]
@inproceedings{DhayalSS14,
title = {Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space},
author = {Anant Dhayal and Jayalal Sarma and Saurabh Sawlani},
year = {2014},
doi = {10.4230/LIPIcs.FSTTCS.2014.597},
url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.597},
researchr = {https://researchr.org/publication/DhayalSS14},
cites = {0},
citedby = {0},
pages = {597-609},
booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India},
editor = {Venkatesh Raman and S. P. Suresh},
volume = {29},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-77-4},
}