NP-hard sets and creativeness over constant time languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)
KeywordsPolynomial Time Productive Function Indexing Scheme Language Class Class CONST
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- J.Balcázar, J.Díaz and J.Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1988.Google Scholar
- H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book, 1967.Google Scholar
- J. Wang, p-creative sets vs. p-completely creative sets, SCT(1989) 24–33.Google Scholar
- J. Wang, p-productivity and polynomial time approximations, SCT(1990) 254–265.Google Scholar
© Springer-Verlag Berlin Heidelberg 1991