Unsatisfiability proofs for distributed clause-sharing SAT solvers (Q6535367)
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: Unsatisfiability proofs for distributed clause-sharing SAT solvers |
scientific article; zbMATH DE number 7777313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unsatisfiability proofs for distributed clause-sharing SAT solvers |
scientific article; zbMATH DE number 7777313 |
Statements
Unsatisfiability proofs for distributed clause-sharing SAT solvers (English)
0 references
13 December 2023
0 references
SAT solving
0 references
distributed computing
0 references
0.7385620474815369
0 references
0.7329318523406982
0 references
0.7287929654121399
0 references
0.7230679392814636
0 references
0.7228620648384094
0 references
