On bounded truth-table, conjunctive, and randomized reductions to sparse sets

This publication has 17 references indexed in Scilit:

• Relating equivalence and reducibility to sparse sets
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Turing machines with few accepting computations and low sets for PP
  Journal of Computer and System Sciences, 1992
• Relativizing relativized computations
  Theoretical Computer Science, 1989
• Sparse Sets, Lowness and Highness
  SIAM Journal on Computing, 1986
• The complexity of promise problems with applications to public-key cryptography
  Information and Control, 1984
• Some connections between nonuniform and uniform complexity classes
  Published by Association for Computing Machinery (ACM) ,1980
• A Note on Sparse Complete Sets
  SIAM Journal on Computing, 1979
• Relationship between density and deterministic complexity of MP-complete languages
  Published by Springer Nature ,1978
• On Isomorphisms and Density of $NP$ and Other Complete Sets
  SIAM Journal on Computing, 1977
• A comparison of polynomial time reducibilities
  Theoretical Computer Science, 1975