Average-case hardness conjecture for approximating the Sherrington–Kirkpatrick partition function
Statement
Let have independent and identically distributed entries . Let denote the target approximation to the partition function, and let an oracle operate in a real-valued computational model, such as a Blum–Shub–Smale machine.
Average-case hardness conjecture. (a) If
then . (b) More challengingly, if
then .
These are proposed as open average-case hardness statements for computing the Sherrington–Kirkpatrick partition function. The second variant asks for the same consequence under only inverse-polynomial success probability, and both statements concern algorithms operating on real-valued inputs.
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.