Geometric Complexity Theory V : Efficient algorithms for Noether Normalization ∗ Dedicated to Sri

  • Ramakrishna Ketan D. Mulmuley
  • Published 2016

Abstract

We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether’s Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give… (More)

Topics

  • Presentations referencing similar topics