Construct and verify polynomial-time reductions between computational problems
Constructs and verifies polynomial-time reductions between computational problems for NP-completeness proofs.
npx claudepluginhub a5c-ai/babysitterThis skill is limited to using the following tools:
Provides expert guidance on constructing polynomial-time reductions for NP-completeness proofs and problem classification.
Activates when the user asks about AI prompts, needs prompt templates, wants to search for prompts, or mentions prompts.chat. Use for discovering, retrieving, and improving prompts.
Search, retrieve, and install Agent Skills from the prompts.chat registry using MCP tools. Use when the user asks to find skills, browse skill catalogs, install a skill for Claude, or extend Claude's capabilities with reusable AI agent components.
This skill should be used when the user asks to "create an agent", "add an agent", "write a subagent", "agent frontmatter", "when to use description", "agent examples", "agent tools", "agent colors", "autonomous agent", or needs guidance on agent structure, system prompts, triggering conditions, or agent development best practices for Claude Code plugins.