« first day (1992 days earlier)      last day (1637 days later) » 

ABD
ABD
1:33 AM
Hey @vzn,

I am writing a draft about a SAT algorithm and i was hoping you (or others) could help me understand why it can't be published. Arxiv mods told me it is not a "substantive self-contained research result that would be considered refereeable for publication in a conventional journal". Is it vague / missing some points ?

Link : https://drive.google.com/file/d/1fU4tyCZu9CXcMgY8qumWOEua06gH-8PY/view
 
 
20 hours later…
Thomas Klimpel
Thomas Klimpel
9:40 PM
@ABD What is your own opinion on your algorithm? What is its worst case runtime? Can it err? Can it just stay silent, and say neither SAT nor UNSAT? Can it err on both sides, or only on one side (i.e. claiming UNSAT even so there was a satisfying assignment not discovered by the algorithm)?
 
 
1 hour later…
Thomas Klimpel
Thomas Klimpel
11:07 PM
Here is my opinion on your algorithm: Its worst case runtime is exponential. It will not err, but it will output all (potentially exponentially many) satisfying assignments. But is runtime can be exponential even if there is just one satisfying assignment.
 

« first day (1992 days earlier)      last day (1637 days later) »