On Polynomial Time Turing and Many-One Completeness in PSPACE.

Osamu Watanabe Shouwen Tang

Published in: Computational Complexity Conference (1989)

Keyphrases

turing machine
special case
machine intelligence
complexity bounds
approximation algorithms
data quality
database
artificial intelligence
upper bound
worst case
finite automata
np hardness