Close
Register
Close Window

CS4114 Formal Languages Spring 2021

Chapter 11 Limits to Computing

Show Source |    | About   «  11.5. NP-Completeness Part 2   ::   Contents   ::   11.7. Coping with NP-Complete Problems  »

11.6. NP-Completeness Proofs

11.6.1. NP-Completeness Proofs and SATISFIABILITY Problem

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

   «  11.5. NP-Completeness Part 2   ::   Contents   ::   11.7. Coping with NP-Complete Problems  »

nsf

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Nov 04, 2021. Created using Sphinx 2.4.4.
Close Window