Polynomial terse sets

This publication has 10 references indexed in Scilit:

• Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
  Information Processing Letters, 1986
• The complexity of optimization problems
  Published by Association for Computing Machinery (ACM) ,1986
• On Parallel Searching
  SIAM Journal on Computing, 1985
• The complexity of facets (and some facets of complexity)
  Journal of Computer and System Sciences, 1984
• Searching, Merging, and Sorting in Parallel Computation
  IEEE Transactions on Computers, 1983
• On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
  SIAM Journal on Computing, 1983
• On the unique satisfiability problem
  Information and Control, 1982
• Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
  Information and Control, 1982
• A comparison of polynomial time reducibilities
  Theoretical Computer Science, 1975
• Semirecursive sets and positive reducibility
  Transactions of the American Mathematical Society, 1968