Some algorithms and hardness results for the planted clique problem