NP-hardness conjecture for p-adic feasibility of sparse polynomials
Statement
For a prime , let denote the class of -nomials in variables, and let be the feasibility problem for rational roots over the -adic field . The p-adic NP-hardness conjecture. For any fixed prime ,
is -hard. The analogous real feasibility problem is already known to be -hard for broader families with more than monomials, and the conjecture predicts the same phenomenon for multivariate -nomials over .
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.