This code turns a SAT problem in DIMACS CNF format into Rust code that compiles iff the SAT problem is unsatisfiable, thus proving that compiling Rust is NP-hard. See the blog post for details.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
This code turns a SAT problem in DIMACS CNF format into Rust code that compiles iff the SAT problem is unsatisfiable, thus proving that compiling Rust is NP-hard. See the blog post for details.