Login / Signup

Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma.

Ketan Mulmuley
Published in: FOCS (2012)
Keyphrases
  • complexity theory
  • computational geometry
  • theoretical basis
  • geometric structure
  • image sequences
  • computer graphics
  • convex hull
  • johnson lindenstrauss
  • query processing
  • test cases