https://github.com/meithecatte/rustc-sat

Makes rustc's exhaustiveness checker solve SAT problems
https://github.com/meithecatte/rustc-sat

Last synced: 6 months ago
JSON representation

Makes rustc's exhaustiveness checker solve SAT problems

• Host: GitHub
• URL: https://github.com/meithecatte/rustc-sat
• Owner: meithecatte
• License: apache-2.0
• Created: 2021-07-07T23:27:32.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2021-07-08T00:24:21.000Z (over 4 years ago)
• Last Synced: 2025-04-05T05:51:12.390Z (11 months ago)
• Language: Rust
• Homepage: https://niedzejkob.p4.team/rust-np/
• Size: 8.79 KB
• Stars: 15
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE-APACHE

Awesome Lists containing this project

README

          
# rustc-sat

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](https://niedzejkob.p4.team/rust-np/) for details.