Re: What the hell is #P-Complete?
A problem is P‑complete if the solution is easy to find, and NP‑complete if the answer is also easy to check. The paper shows that the n‑Queens problem can be cracked, but not a second time quickly.
This needs to be reformulated.
Please El Reg, can we have a diagramming tool to quickly upload a simple back-on-the envelope diagram to explain things?
Biting the hand that feeds IT
