A note on testing the resultant

DOI10.1006/JCOM.1995.1016zbMATH Open0851.68043OpenAlexW2007611444MaRDI QIDQ1908893FDOQ1908893

Authors: Thomas Lickteig, Klaus Meer 

Publication date: 10 November 1996

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1995.1016

Recommendations

• On the complexity of the multivariate resultant
• The multivariate resultant is NP-hard in any characteristic
• scientific article; zbMATH DE number 3928209
• On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?

zbMATH Keywords

resultant

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Matrices in elimination theory
• The multivariate resultant is NP-hard in any characteristic
• On the complexity of the multivariate resultant
• Title not available (Why is that?)
• Some results on test elements

This page was built for publication: A note on testing the resultant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908893)