II.
LibraryProcess overview
Reference · livelib-process:computer-science--np-completeness-proof
np-completeness-proof overview
Establish NP-completeness of computational problems via reduction with gadget library
Attributes
displayName
np-completeness-proof
description
Establish NP-completeness of computational problems via reduction with gadget library
libraryPath
library/specializations/domains/science/computer-science/np-completeness-proof.js
specialization
computer-science
usesAgents
- complexity-theorist
- theorem-proving-expert
- algorithm-analyst
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:research-engineer·RoleResearch Engineer
- role:computational-scientist·RoleComputational Scientist
lib_requires_skill_area3
- skill-area:language-design·SkillAreaProgramming Language Design
- skill-area:compiler-implementation·SkillAreaCompiler & Interpreter Implementation
- skill-area:graph-algorithms·SkillAreaGraph Algorithms
uses_agent3
- lib-agent:computer-science--complexity-theorist·LibraryAgentcomplexity-theorist
- lib-agent:computer-science--theorem-proving-expert·LibraryAgenttheorem-proving-expert
- lib-agent:computer-science--algorithm-analyst·LibraryAgentalgorithm-analyst
Incoming edges
None.