Hello, here is a link to my work on the topic of P vs NP. I show the idea that for a subclass of Pos-1in3-sat formulas without repeating variables in clauses and without repeating clauses themselves, there is a "THRESHOLD" after which the formula becomes unsatisfiable. I derive two subclasses that are solved in constant time, and one class with a description of this "threshold", it is solved polynomials. I want to show you an idea, but I can't make a formal decision, maybe you have some ideas on this. Write. Link: https://doi.org/10.5281/zenodo.18508635
p vs np, positive 1 in 3 sat
- Thread starter genq1221
- Start date