REDUX
HomeAbout Us

ABOUT US
Welcome to Redux, a platform for NP-Complete problems. Input your challenges and gain access to reductions, solutions, verifiers, and visualizations. Join our community of problem solvers and unravel computational complexities using the application's library. The project was greatly inspired by Richard Karp's paper "Reducibility Among Combinatorial Problems".

Contributors

This project was started by Dr. Paul Bodily, who is also the ISU Faculty Sponsor of the project. The students who have contributed to the creation of the application are:

  • Kaden Marchetti
  • Caleb Eardley
  • Daniel Igbokwe
  • Alex Diviney
  • Janita Aamir
  • Andrija Sevaljevic
  • Garret Stouffer
  • Porter Glines
  • Show Pratoomratana
  • Russell Phillips
  • Michael Crapse
  • Ian Gonzalez

Learn More
Additional documentation can be found at the following links:
    Github
    Wikipedia: What is NP-Complete?
    Karp's 21 NP-Complete Problems
    Redux GUI Documentation
ISU Logo