Theory of Algorithms

Chapter 9 Limits to Computing

| About   中文版   «  9.6. Formula Satisfiability   ::   Contents   ::   9.8. Reduction of SAT to 3-SAT  »

9.7. 3-CNF Satisfiability

9.7.1. 3-CNF Satisfiability (3-SAT)

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

Try out an instance of the 3-SAT problem on your own.

   «  9.6. Formula Satisfiability   ::   Contents   ::   9.8. Reduction of SAT to 3-SAT  »

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