TheCook-Levin theoremprovides an interesting result in this direction: No problem in NP is any harder than SAT. What his means is that if I had an oracle (basically an algorithm that I can see the input/output of but none of the workings) that solved SAT, by asking it to solve clever...
is well defined and independent on the BCs. 3.2. Condition 2 The claimed partition function per site of the 3D model 𝑍(𝐾1,𝐾2,𝐾3)Z(K1,K2,K3) must reduce to Onsager’s solution whenever one of the three reduced temperatures vanishes. Indeed, suppose without loss of generality ...