WELCOME TO REDUX
Redux is a dynamic, interactive computer science knowledgebase consisting of canonical computer science problems, solutions, and reduction algorithms. The following pages provide helpful background to the organization of problems, solutions, and reductions in Redux based on the concept of complexity classes:
Computational problem, Algorithm, List of algorithms, Complexity class, P (complexity), NP (complexity), NP-hardness, NP-completeness, Karp's 21 NP-complete problems, List of NP-complete problems, Many-one reduction, Gadget (computer science), Approximation algorithm.
ACCESS REDUX CONTENT
All of the content of the Redux knowledge base can be accessed directly via:
C# Library import (instructions coming soon)
LEARN MORE
Additional documentation can be found at the following links:
