polynomial_time_reductions
CommunityProve NP-hardness with polynomial-time reductions.
Education & Research#computability#lean4#theorem-proving#np-hardness#polynomial-time-reductions#complexity-theory#reductions
Authorbneb
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Provides a formal, structured approach to prove hardness of computational problems by constructing polynomial-time reductions from known-hard problems to a target problem, enabling rigorous NP-hardness or NP-completeness arguments.
Core Features & Use Cases
- Formal reduction blueprint: defines a computable transformation from instances of a source problem to instances of a target problem and establishes correctness criteria.
- Correctness scaffolding: outlines forward and backward directions to ensure YES-instances map correctly between problems, with placeholders for actual arguments.
- Lean 4 templates: offers Lean 4 skeletons for encoding problems, reductions, and proofs to guide formalization and verification.
Quick Start
Define a reduction from a known hard problem (e.g., SAT) to your target problem and prove that a solution to the target corresponds to a solution to the source.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: polynomial_time_reductions Download link: https://github.com/bneb/perqed/archive/main.zip#polynomial-time-reductions Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.