Exact computation of the number of accepting paths of an NTM
From MaRDI portal
Publication:2636555
DOI10.1007/978-3-319-74180-2_9zbMath1497.68219OpenAlexW2782773508MaRDI QIDQ2636555
Subrahmanyam Kalyanasundaram, Kenneth W. Regan
Publication date: 5 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_9
Analysis of algorithms (68W40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Classical models of computation (Turing machines, etc.) (68Q04)
This page was built for publication: Exact computation of the number of accepting paths of an NTM
