reduction-builder

Solid

Construct and verify polynomial-time reductions between computational problems

AI & Automation 814 stars 53 forks Updated today MIT

Install

View on GitHub

Quality Score: 93/100

Stars 20%
97
Recency 20%
100
Frontmatter 20%
70
Documentation 15%
43
Issue Health 10%
50
License 10%
100
Description 5%
100

Skill Content

# Reduction Builder ## Purpose Provides expert guidance on constructing polynomial-time reductions for NP-completeness proofs and problem classification. ## Capabilities - Gadget library for common reductions (3-SAT, Vertex Cover, etc.) - Reduction verification (correctness in both directions) - Polynomial-time verification - Visualization of gadget constructions - Generate reduction documentation - Chain multiple reductions ## Usage Guidelines 1. **Problem Analysis**: Understand source and target problem structures 2. **Gadget Selection**: Choose or design appropriate gadgets 3. **Reduction Construction**: Build the polynomial-time mapping 4. **Correctness Proof**: Prove both directions of the reduction 5. **Time Analysis**: Verify polynomial running time ## Tools/Libraries - Graph visualization - LaTeX documentation - Formal verification tools

Details

Author
a5c-ai
Repository
a5c-ai/babysitter
Created
4 months ago
Last Updated
today
Language
JavaScript
License
MIT

Related Skills