Concept information
PREFERRED TERM
SAT solver
DEFINITION(S)
- algorithm for efficiently solving instances (cases) of the SAT problem. The theoretical complexity of the SAT problem means that we know that for a certain number of instances we won't be able to find a solution in a reasonable time. The aim of SAT solvers is to find a solution for as many instances as possible. In practice, this is generally sufficient for real problems. (Source: https://ia.gdria.fr/Glossaire/solveur-sat/ )
BROADER CONCEPT(S)
IN OTHER LANGUAGES
-
French
URI
http://data.loterre.fr/ark:/67375/23L-HP7170CW-N
{{toUpperCase label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}