The Multivariate Resultant Is NP-hard in Any Characteristic

DOI10.1007/978-3-642-15155-2_42zbMath1287.68056arXiv0912.2607OpenAlexW1833412006MaRDI QIDQ3586107

Natacha Portier, Bruno Grenet, Pascal Koiran

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.2607

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Geometric complexity theory V: Efficient algorithms for Noether normalization

This page was built for publication: The Multivariate Resultant Is NP-hard in Any Characteristic