Actual Discussions

• A polynomial time algorithm for computing the permanent in GF(3^q)
  Vadim Tarin, claiming the non-uniform equality between P and NP, or that RP = NP
  • Comment: Problem with Vadim Tarin's NP=RP Proof
    Charanjit Jutla
• Theory of Computation: Goals and Perspective
  Materials of a ACM workshop on Strategic Directions in Computing Research