name: asymptotic-notation-calculator description: Automated derivation and simplification of Big-O, Big-Omega, and Big-Theta expressions for algorithm analysis allowed-tools:
- Bash
- Read
- Write
- Edit
- Glob
- Grep metadata: specialization: computer-science domain: science category: algorithm-analysis phase: 6
Asymptotic Notation Calculator
Purpose
Provides expert guidance on analyzing, simplifying, and comparing asymptotic complexity expressions for algorithm analysis.
Capabilities
- Parse and simplify asymptotic expressions
- Compare complexity classes
- Identify dominant terms
- Handle logarithmic, polynomial, and exponential factors
- Generate LaTeX-formatted notation
- Prove asymptotic relationships
Usage Guidelines
- Expression Analysis: Parse complexity expressions into canonical forms
- Simplification: Apply dominance rules to simplify nested expressions
- Comparison: Determine ordering between complexity classes
- Documentation: Generate properly formatted asymptotic notation
- Verification: Prove Big-O, Big-Omega, and Big-Theta relationships
Tools/Libraries
- SymPy
- Symbolic computation
- LaTeX rendering