Open Internet by MindsNet

Validating NP-hard Proofs for Higher-Dimensional Problems

The author seeks validation for their NP-hard proof of a higher-dimensional problem. They are uncertain about the correctness of their reduction and documentation. The challenge lies in verifying the proof and identifying potential pitfalls.

Mathematics & logic, Mathematics, Mathematical Logic