Algorithms for Sat and upper bounds on their complexity (Q2487388): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q234736 |
Changed an Item |
||
| Property / author | |||
| Property / author: Maxim Vsemirnov / rank | |||
Normal rank | |||
Revision as of 11:44, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Sat and upper bounds on their complexity |
scientific article |
Statements
Algorithms for Sat and upper bounds on their complexity (English)
0 references
5 August 2005
0 references
propositional satisfiability problem
0 references
