Smale's conjecture on the complexity of Hilbert's Nullstellensatz over the complex numbers
Statement
Let be a sequence of polynomials in . The Hilbert Nullstellensatz decision problem over asks whether these polynomials have a common zero in . Smale's conjecture. There is no polynomial-time algorithm for deciding the Hilbert Nullstellensatz over . This conjecture asserts that the corresponding decision problem does not belong to the class and concerns the computational difficulty of using Hilbert's criterion in practice.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.