Hacker News
Lobsters
- Dependency hell is NP-complete (2016) https://research.swtch.com/version-sat 4 comments math , programming
- Version SAT https://research.swtch.com/version-sat 8 comments compsci
- Dependency Hell is NP-hard (by Russ Cox, 2016) https://research.swtch.com/version-sat 32 comments linux
- New NP-completeness proof by Russ Cox that, because of lowered assumptions, "applies to essentially any foreseeable operating system or language package manager" including Haskell's Cabal https://research.swtch.com/version-sat 16 comments haskell
- Version SAT: Dependency hell is NP-complete. But maybe we can climb out. https://research.swtch.com/version-sat 10 comments compsci
- Dependency hell is NP-complete https://research.swtch.com/version-sat 34 comments programming
- Dependency hell is NP-complete https://research.swtch.com/version-sat 13 comments rust
- Version SAT by rsc https://research.swtch.com/version-sat 8 comments golang
Linking pages
- proposal/24301-versioned-go.md at master · golang/proposal · GitHub https://github.com/golang/proposal/blob/master/design/24301-versioned-go.md 80 comments
- GitHub - konstin/sudoku-in-python-packaging https://github.com/konstin/sudoku-in-python-packaging 54 comments
- Calculating type sets is harder than you think | Mero's Blog https://blog.merovius.de/posts/2022-05-16-calculating-type-sets/ 53 comments
- A Universal Package Manager https://matt-rickard.com/a-universal-package-manager/ 16 comments
- Dependency Resolution Made Simple https://borretti.me/article/dependency-resolution-made-simple 0 comments
Related searches:
Search whole site: site:research.swtch.com
Search title: research!rsc: Version SAT
See how to search.