P=NP Solving SAT via Transcendent Reduction

Utilize la misma reduccion tracendental que utilize para romper RSA. Para probar P=NP.

Paper and Code in Zenodo DOI: https://doi.org/10.5281/zenodo.19078857

Paper in IPFS: https://dweb.link/ipfs/bafkreibki6nkk3xki4drvbcovjtl3mf6nm2eld2b7ddnkapdapf5qxhvl4

Code in IPFS: https://dweb.link/ipfs/bafkreicy3ocq7ckrtgnwnf4idaw4qf3daipehpod4k72yaxvzxpyftidqq