Something I actually believe: That P=NP, and that it’ll be proven by someone finding a simple sublanguage for expressing P problems that admits a simple unification algorithm for instantiating solutions.
-
-
(Practical example: Cargo’s dependency resolver is predicated on the assumption that NP is easy in practice for inputs typical of this workload, and experience bears that out.)
-
Cargo is an example of the ecosystem limiting usage in order to avoid triggering combinatorial explosion. AFAIK, the resolver itself does not use any heuristics that have been needed in other package managers. Perhaps this is what you are referring to?
End of conversation
New conversation -
-
-
It depends on what NP problems you're trying to solve; there's plenty of average-case hard problems in crypto that no SAT solver is ever going to solve
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.