On the reduction theory for average case complexity

This publication has 5 references indexed in Scilit:

• Matrix decomposition problem is complete for the average case
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• No better ways to generate hard NP instances than picking uniformly at random
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1990
• On the theory of average case complexity
  Published by Association for Computing Machinery (ACM) ,1989
• Random instances of a graph coloring problem are hard
  Published by Association for Computing Machinery (ACM) ,1988
• Average Case Complete Problems
  SIAM Journal on Computing, 1986