On Polynomial Time Isomorphisms of Some New Complete Sets.

Juris Hartmanis Leonard Berman

Published in: J. Comput. Syst. Sci. (1978)

Keyphrases

computational complexity
special case
decision trees
worst case
finite automata
definite clause