Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) (Q3985743)
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: Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) |
scientific article; zbMATH DE number 27704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) |
scientific article; zbMATH DE number 27704 |
Statements
27 June 1992
0 references
satisfiability
0 references
SAT problem
0 references
matrides
0 references
algorithms
0 references
0.8712347745895386
0 references
0.794533908367157
0 references
0.7928833365440369
0 references
