Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lin, Tianrong
Format:	Preprint
Published:	2021
Subjects:	Computational Complexity Formal Languages and Automata Theory 68Q15, 68Q17
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2110.06211