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

Osamu Watanabe Shouwen Tang

Published in: Theor. Comput. Sci. (1992)

Keyphrases

turing machine
computational complexity
special case
machine intelligence
complexity bounds
worst case
approximation algorithms
information retrieval
np hardness
pspace complete
information systems
multi agent
search space
np complete