Hacker News new | ask | show | jobs
by zmonx 3094 days ago
The authors have built a start-up based on these ideas:

http://memcpu.com/

They provide their SAT solver as a service that you can try.

A related paper I recommend in this context is NP-complete Problems and Physical Reality by Scott Aaronson:

https://www.scottaaronson.com/papers/npcomplete.pdf
2 comments
whaaswijk 3094 days ago
It's worth noting that Scott Aaronson has commented on previous work by the same authors: https://www.scottaaronson.com/blog/?p=2212 . At the time, he was convinced that their approach wouldn't scale. I'm not sure about their current approach, but at a glance it seems similar to the previous one.

Previous work: https://arxiv.org/pdf/1411.4798.pdf

link
petters 3094 days ago
Do I have to register for the SAT solver?

Their web page says: "We are currently in Alpha Test. Users can submit problems via our SaaS portal in Conjunctive Normal Form (CNF), which ultimately represents the normal form of Boolean propositions for the problem’s variables and constraints"

I have no problem providing real, hard SAT instances in CNF. It should be really easy to verify whether they have something good, unless they have a size restriction.

link