II.
LibraryAgent overview
Reference · livelib-agent:computer-science--complexity-theorist
complexity-theorist overview
Agent specialized in computational complexity theory, reductions, and problem classification
Attributes
displayName
complexity-theorist
description
Agent specialized in computational complexity theory, reductions, and problem classification
libraryPath
library/specializations/domains/science/computer-science/agents/complexity-theorist/AGENT.md
specialization
computer-science
role
Algorithm Theory Agent
expertise
- Complexity classification reasoning
- Reduction construction guidance
- Lower bound proof techniques
- Complexity class relationships
- Open problem awareness
Outgoing edges
lib_applies_to_domain1
- domain:computer-science·DomainComputer Science
lib_belongs_to_specialization2
- specialization:theoretical-computer-science·SpecializationTheoretical Computer Science
- specialization:computer-science·SpecializationComputer Science
lib_implements_workflow1
- workflow:research-grant-lifecycle·WorkflowResearch Grant Lifecycle
lib_involves_role2
- role:computational-scientist·RoleComputational Scientist
- role:research-scientist·RoleResearch Scientist
lib_requires_skill_area3
- skill-area:np-hard-heuristics·SkillAreaHeuristics for NP-Hard Problems
- skill-area:graph-algorithms·SkillAreaGraph Algorithms
- skill-area:mathematical-reasoning·SkillAreaMathematical Reasoning
Incoming edges
uses_agent6
- lib-process:computer-science--algorithm-complexity-analysis·LibraryProcessalgorithm-complexity-analysis
- lib-process:computer-science--approximation-algorithm-design·LibraryProcessapproximation-algorithm-design
- lib-process:computer-science--computational-problem-classification·LibraryProcesscomputational-problem-classification
- lib-process:computer-science--decidability-analysis·LibraryProcessdecidability-analysis
- lib-process:computer-science--np-completeness-proof·LibraryProcessnp-completeness-proof
- lib-process:computer-science--type-system-design·LibraryProcesstype-system-design