OpenSkillIndex← back to search
claude-codescience

Babysitter complexity-class-oracle

Classify problems into complexity classes with supporting evidence and proof strategies

install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/computer-science/skills/complexity-class-oracle" ~/.claude/skills/a5c-ai-babysitter-complexity-class-oracle && rm -rf "$T"
manifest: library/specializations/domains/science/computer-science/skills/complexity-class-oracle/SKILL.md
tags
#complexity-theory#problem-classification#computational-complexity#np-problems#complexity-zoo
source content

Complexity Class Oracle

Purpose

Provides expert guidance on classifying computational problems into complexity classes and understanding class relationships.

Capabilities

  • Determine membership in P, NP, co-NP, PSPACE, EXPTIME
  • Identify complete problems for each class
  • Query known complexity results database
  • Suggest proof strategies for classification
  • Generate complexity landscape diagrams
  • Explain class inclusions and separations

Usage Guidelines

  1. Problem Characterization: Formalize the computational problem
  2. Class Investigation: Check membership in relevant classes
  3. Evidence Collection: Gather evidence for classification
  4. Strategy Selection: Choose proof strategy for membership
  5. Documentation: Generate classification report

Tools/Libraries

  • Complexity Zoo database
  • Diagram generation
  • LaTeX documentation