np-completeness
CommunityFormal NP-hardness proofs with CLRS rigor.
Education & Research#proofs#theory#clrs#reductions#np-completeness#computational-complexity#polynomial-time
AuthorArcadi4
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This skill helps researchers and students formally verify NP-hardness and NP-completeness by guiding the creation of polynomial-time reductions, defining decision languages, and validating certificate-based NP-membership.
Core Features & Use Cases
- Define a problem's decision language and input encoding.
- Propose reductions from canonical NP-complete problems (SAT, CIRCUIT-SAT, CLIQUE, VERTEX-COVER, HAM-CYCLE, TSP, SUBSET-SUM) and prove forward and reverse directions.
- Provide a structured framework for completeness proofs, including encoding size arguments and reduction composition.
Quick Start
Outline a complete NP-completeness analysis for a target problem by selecting a known NP-complete source, constructing a polynomial-time reduction, and proving membership and hardness.
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: np-completeness Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#np-completeness 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.