Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mayank
on Feb 5, 2011
|
parent
|
context
|
favorite
| on:
Painless NP-complete problems: an embedded DSL for...
I believe they're also used for verifying potential new compiler optimizations:
http://blog.regehr.org/archives/247
Check out the SAT competition for state of the art solvers:
http://www.satcompetition.org/
jules
on Feb 5, 2011
[–]
They can also be used to do the actual optimizations. For example most formulations of the register allocation problem are NP-complete. SMT formulas can be used as a very powerful abstract domain in abstract interpretation.
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Check out the SAT competition for state of the art solvers: http://www.satcompetition.org/