References for Disjunctive normal form: Computational complexity

Back to article
See all references for article

References to other articles in the 'Computational complexity' section

Boolean satisfiability problem
Co-NP-hard
Conjunctive normal form
Duality principle (Boolean algebra)
NP-completeness
P (complexity)
Tautology (logic)

Source on Wikipedia (https://en.wikipedia.org)

--

Gemipedia Home
Go to Article
Using English Wikipedia. Change Language?

--
Size: 988.0 B. 99.42% smaller than original: 166.14 KB 🤮
Fetched: 17 ms. Converted: 453 ms. 🐇

Made with 📚 and ❤️ by Acidus (mailto://)

All Wikipedia content is licensed under CC BY-SA 3.0