I am thinking of the classical paper, https://www.cs.sfu.ca/~kabanets/Research/poly.html

Can someome link to some papers/reviews that give a sampling of what are the recent thoughts in this direction?

I am equally happy to know of what are the recent directions in the topic of pseudorandomness and derandomization.

  • 1
    $\begingroup$ You will get more responses and exposure on cstheory.se. $\endgroup$ – Yuval Filmus Oct 30 '15 at 11:43
  • $\begingroup$ If you'd like to see this migrated to CSTheory.SE, please flag it for moderator attention using "flag" under the question (but don't cross-post). Also, I suggest that you edit the question to include a full reference to the paper (title, authors, where published) so that the question will still be meaningful in case the link dies, and so that the question can be findable by others using search in case others have similar questions. Also, what research have you done? Have you used Google Scholar to look through other papers that cite it? $\endgroup$ – D.W. Oct 30 '15 at 14:08
  • $\begingroup$ Finally: please don't use the reference-question tag (this might not be obvious, but that's more or less reserved for special purposes) -- I'll fix that for you. $\endgroup$ – D.W. Oct 30 '15 at 14:08
  • 1
    $\begingroup$ more on recent developments here tying it into arithmetic complexity etc $\endgroup$ – vzn Oct 30 '15 at 16:03
  • 1
    $\begingroup$ @vzn Thanks for the link! Your list is interesting! Can you share some thoughts about how/if you see these developments in arithmetic complexity being related to the progress in the direction of pseudorandomness and extractors as in the recent works of Raghu Meka, Xin Li etc ? $\endgroup$ – Anirbit Oct 30 '15 at 22:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.