Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch
Friday, September 20, 2002
Ketan Mulmuley and Milind Sohoni have an interesting approach to
separating complexity classes using algebraic geometry. Ken Regan
describes this approach for the common complexity theorist in the October BEATCS
Computational Complexity Column.
Post a Comment