Find the frontier
Identify missing solver access, costly constructions, and opportunities to improve the atlas.
Problem
Reductions
An executable atlas of NP-hard problems
and the reductions between them.
Problems and reductions
A different formulation can unlock a different solver. Explore the connections, understand their cost, and follow the construction all the way to code.
Research loop
Our ambition is a continuous research loop: agents choose useful questions, construct reductions, search for counterexamples, and turn surviving ideas into reusable mathematics.
Build a hypothesis
Explore the literature. Propose a mapping, its assumptions, and the claims it must satisfy.
Try to break it
Challenge the construction with independent implementations and adversarial examples.
Grow the atlas
Review the evidence. Integrate useful results and use what was learned to guide the next question.
Built today: agent-assisted implementation and review workflows. Next frontier: autonomous question selection and persistent experiment records.
Explore agent workflowsExample reduction
Every registered reduction has a statement and proof in the paper and executable code with solution recovery.
Vertex Cover to
Independent Set
A vertex cover and an independent set are complements. A simple construction shows how the atlas connects definitions, solution recovery, and executable code.
Examine the reductionGet started
Use the atlas from the terminal, from Rust, or through an
agent.
All three share the same models and constructions.
# Install the CLI $ cargo install problemreductions-cli # Explore a problem $ pred show MIS # Search for a route to a solver $ pred path MIS ILP