Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability in Boolean Logic (SAT problem) is polynomial? |
scientific article; zbMATH DE number 7510991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability in Boolean Logic (SAT problem) is polynomial? |
scientific article; zbMATH DE number 7510991 |
Statements
Satisfiability in Boolean Logic (SAT problem) is polynomial? (English)
0 references
21 April 2022
0 references
Boolean logic
0 references
satisfiability problem
0 references
SAT algorithm
0 references
