complexity
Algorithm complexity analysis
Source facts
- Repository
- ffsshhttiikk/opencode-agents-skills
- Last source activity
- February 28, 2026 at 22:48
- Detected SKILL.md language
- English
- Stars
- 3
- Forks
- 2
Install options
The review-first prompt is selected by default. You can switch to a direct command or download a local copy.
Review the source files
Read SKILL.md and any companion files shown by SkillsMP before deciding whether to install.
Showing SKILL.md
SKILL.md
Source instructions · Read-only preview- name
- complexity
- description
- Algorithm complexity analysis
- license
- MIT
- compatibility
- opencode
- metadata
- {"audience":"programmers","category":"computer-science"}
## What I do
- Analyze time and space complexity of algorithms
- Classify problems by complexity classes (P, NP, PSPACE)
- Prove NP-completeness and NP-hardness
- Apply asymptotic notation (Big-O, Ω, Θ)
- Design approximation algorithms
- Analyze randomized algorithm complexity
## When to use me
When optimizing algorithms, proving computational limits, or classifying problem difficulty.
## Key Concepts
- **Big-O**: f = O(g) if ∃c,n₀: f(n) ≤ cg(n) for n ≥ n₀
- **P**: Problems solvable in polynomial time
- **NP**: Problems verifiable in polynomial time
- **NP-Complete**: Hardest problems in NP, polynomial-time reduction
- **Space Complexity**: Memory requirements vs input size
- **Polynomial-Time Reduction**: Transform one problem to another preserving complexity
View on GitHub