Package Descriptions for Ubuntu

Browsing French translation

  1. Series trusty
  2. Template “ddtp-ubuntu-universe”
  3. French (fr)
  4. Browsing French translation
59617 of 82199 results First • • • Last
59617.
Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems.
 
Description
Malgré la complétude NP des problèmes de satisfaisabilité de formules booléennes (SAT), les solveurs SAT sont souvent capables de trancher dans un délai raisonnable. Comme tous les autres problèmes de complétude NP sont réductibles à SAT, les solveurs sont devenus des outils polyvalents pour cette classe de problèmes.
Translated by Michael Vogt
Located in Package: picosat
59617 of 82199 results First • • • Last

This translation is managed by Ubuntu French Translators, assigned by Ubuntu Translators.

You are not logged in. Please log in to work on translations.