布尔可满足性问题
Sign in to saveAlso known as propositional satisfiability problem, SATISFIABILITY, SAT
problem of determining if a Boolean formula could be made true
Wikidata facts
- Instance of
- constraint satisfaction problem
- Subclass of
- decision problem
Show 5 more facts
- maintained by WikiProject
- WikiProject Mathematics
- topic's main category
- Category:Satisfiability problems
- Commons category
- Boolean satisfiability problem
- computational complexity
- NP-complete
- Stack Exchange tag
- cstheory.stackexchange.com/tags/sat
Sources (2)
via Wikidata · CC0
Article · 中文
可滿足性（英語：Satisfiability）是用來解決給定的真值方程式，是否存在一组变量赋值，使問題为可满足。布尔可滿足性問題（Boolean satisfiability problem；SAT ）屬於決定性問題，也是第一个被证明屬於NP完全的问题。此問題在電腦科學上許多的領域皆相當重要，包括、演算法、人工智慧、等等。
Abstract from DBpedia / Wikipedia · CC BY-SA