Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4205154944 / rank | |||
Normal rank | |||
Revision as of 18:24, 19 March 2024
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
