LaghZen

7 ms·

1. 1.▲
   Show HN: SDF-Field Synthesis – rendering SDF without ray marching(zenodo.org)

   2 points by LaghZen 11mo ago|0 comments
2. 2.▲
   by LaghZen 1y ago

   Thanks for the help! It will take at least a week to fix the gap. During the addition, I came across a more serious problem: there was a contradiction between the "hard" function (ε = 2^(—n)) and the statement Algphys ⊆ P. I'
3. 3.▲
   by LaghZen 1y ago

   You’re right — the paper does not currently contain an explicit theorem stating, word-for-word, that “every polynomial-time Turing machine is mapped to a low-rigidity region.” In section C.4, at the end of step 4, there is a statement: the
4. 4.▲
   by LaghZen 1y ago

   Thanks for the follow-up! Equivalence of P and Algphys: Section 2.3 and Appendix D show any polynomial-time algorithm can be modeled in Algphys with preserved complexity. Polynomial Mapping: Section 2.2 and Appendix C detail symplectomorphi
5. 5.▲
   by LaghZen 1y ago

   Hi! Thanks for the question! 1. Algphys is shown to be equivalent to P, meaning any polynomial-time Turing algorithm can be modeled in Algphys. The paper constructs "frustrated" 3-SAT instances requiring exponential time in Algphy
6. 6.▲
   Show HN: Student attempt at proving P ≠ NP using geometry and lattices(zenodo.org)

   6 points by LaghZen 1y ago|8 comments