A nondeterministic Turing machine variant to compute functions
From MaRDI portal
Publication:2067632
DOI10.1016/j.tcs.2021.12.008OpenAlexW4200275080MaRDI QIDQ2067632
João Guilherme Fritsche Colombo, Jerusa Marchi
Publication date: 18 January 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.008
time complexitycomputable functionspolynomial spacedivide and conquernondeterministic Turing machinescounting Turing machines
Cites Work
This page was built for publication: A nondeterministic Turing machine variant to compute functions