Counting Paths in VPA Is Complete for #NC 1
From MaRDI portal
Publication:3578301
DOI10.1007/978-3-642-14031-0_7zbMath1286.68201OpenAlexW1499202745MaRDI QIDQ3578301
Nutan Limaye, Meena Mahajan, Andreas Krebs
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_7
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
A gentle introduction to applications of algorithmic metatheorems for space and circuit classes ⋮ Unnamed Item
This page was built for publication: Counting Paths in VPA Is Complete for #NC 1