布尔可满足性问题
Sign in to saveAlso known as propositional satisfiability problem, SATISFIABILITY, SAT
problem of determining if a Boolean formula could be made true
Wikidata facts
Show 2 more facts
- Commons category
- Boolean satisfiability problem
- 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
Connections
proposition
Entity
theoretical computer science
Entity
NP
Entity
logical consequence
Entity
time complexity
Entity
P
Entity
DPLL algorithm
Entity
polynomial hierarchy
Entity
logic
Entity
Artificial intelligence
Concept
computer science
Entity
truth
Entity
International Standard Book Number
Entity
algorithm
Entity
probability
Entity
name
Entity
set theory
Entity
reason
Entity
cryptography
Entity
digital object identifier
Entity