The computational hardness threshold conjecture for weighted independent sets
Statement
Let be the maximum degree, let be the activity, and let be the critical activity for decay of correlations on the infinite -regular tree. Consider the weighted sum of independent sets, with each independent set having weight . Computational hardness threshold conjecture. For every and all , unless , there does not exist a fully polynomial approximation scheme for counting weighted independent sets in graphs of maximum degree with activity . This conjecture identifies the computational threshold with the uniqueness threshold; below a fully polynomial approximation scheme is known, while hardness above the threshold remains open.
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.