Close
Register
Close Window

CS4114 Formal Languages Spring 2021

Chapter 11 Limits to Computing

Show Source |    | About   «  11.4. NP-Completeness Part 1   ::   Contents   ::   11.6. NP-Completeness Proofs  »

11.5. NP-Completeness Part 2

11.5.1. NP-hard and K-CLIQUE Problem

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

   «  11.4. NP-Completeness Part 1   ::   Contents   ::   11.6. NP-Completeness Proofs  »

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