On the Complexity of L-reachability*
From MaRDI portal
Publication:4976380
DOI10.3233/FI-2016-1371zbMath1371.68154MaRDI QIDQ4976380
K. S. Sunil, M. N. Jayalal Sarma, Balagopal Komarath
Publication date: 28 July 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Space Complexity of Reachability Testing in Labelled Graphs ⋮ Space complexity of reachability testing in labelled graphs
This page was built for publication: On the Complexity of L-reachability*