NP-hard sets and creativeness over constant time languages

  • Manindra Agrawal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)


Polynomial 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.

Unable to display preview. Download preview PDF.


  1. [1]
    J.Balcázar, J.Díaz and J.Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1988.Google Scholar
  2. [2]
    S. Homer, On simple and creative sets in NP, TCS, 47(1986) 169–180.CrossRefGoogle Scholar
  3. [3]
    D, Joseph and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP, TCS 39(1985) 225–237.CrossRefGoogle Scholar
  4. [4]
    K. Ko and D. Moore, Completeness, approximation and density, SIAM J.Comput., 10(1981) 787–796.CrossRefGoogle Scholar
  5. [5]
    D. Kozen, Indexing of subrecursive classes, TCS 11(1980) 277–301.CrossRefGoogle Scholar
  6. [6]
    H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book, 1967.Google Scholar
  7. [7]
    J. Wang, p-creative sets vs. p-completely creative sets, SCT(1989) 24–33.Google Scholar
  8. [8]
    J. Wang, p-productivity and polynomial time approximations, SCT(1990) 254–265.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Manindra Agrawal
    • 1
  1. 1.Department of Computer Science & EngineeringIndian Institute of TechnologyKanpurIndia

Personalised recommendations