Tag
An essay arguing that NP-hard problems are often not as intractable in practice as commonly believed, citing modern solvers and algorithmic advances that handle real-world instances efficiently.
A paper reports an AI-agent-driven attack on Conway's 99-graph problem, providing partial-credit bounds, a forced-structure reduction, and a verifiable framework, without solving the open question.
A blog post explaining how building Brio train track layouts with a toddler inspired the author to explore constraint solving and backtracking search algorithms.
Charlie Marsh's talk explains how uv, a Rust-based Python package manager developed by Astral, solves dependency resolution with a CDCL SAT solver and a unified lockfile, achieving extreme speed by rethinking the toolchain from scratch.