Geometric complexity theory V: Efficient algorithms for Noether normalization

@inproceedings{Mulmuley2016GeometricCT,
  title={Geometric complexity theory V: Efficient algorithms for Noether normalization},
  author={Ketan Mulmuley},
  year={2016}
}
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 deterministic quasi-polynomial time algorithms. These may be contrasted with the standard EXPSPACE-algorithms for these problems in computational… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 90 REFERENCES

Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing

  • Electronic Colloquium on Computational Complexity
  • 2013
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Computational invariant theory

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Polynomial bounds for rings of invariants

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

A taxonomy of problems with fast parallel algorithms

S. Cook
  • Journal of Information and Control, 64(1-3):2–22,
  • 1985
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL