Min/Max-Poly Weighting Schemes and the NL versus UL Problem

DOI10.1145/3070902zbMath1427.68234OpenAlexW2615326312MaRDI QIDQ4973887

Saurabh Sawlani, Anant Dhayal, M. N. Jayalal Sarma

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3070902

zbMATH Keywords

unambiguous logspaceweighting schemesgraph reachability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Min/Max-Poly Weighting Schemes and the NL versus UL Problem