CS4114 Formal Languages and Automata

Chapter 10 Limits to Computing

| About   «  10.2. Reductions   ::   Contents   ::   10.4. Unsolveable Problems  »

10.3. NP-Completeness

10.3.1. Hard Problems

Settings

Proficient Saving... Error Saving
Server Error
Resubmit


Settings

Proficient Saving... Error Saving
Server Error
Resubmit

10.3.2. Proving that a Problem is NP-Complete

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

10.3.3. Coping with NP-Complete Problems

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

   «  10.2. Reductions   ::   Contents   ::   10.4. Unsolveable Problems  »

© Copyright 2011-2025 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Sep 07, 2026. Created using Sphinx 8.2.0.
Close Window