Profesyonel çevirmenler, işletmeler, web sayfaları ve erişimin serbest olduğu çeviri havuzlarından.
the dependency web of debian packages has been converted into the boolean satisfiability problem (sat) so that a normal resolver could find a solution.
der abhängigkeitsgraph der debian-pakete wurde in ein boole'sches erfüllbarkeitsproblem (sat) umgewandelt, so dass ein normaler lösungsalgorithmus eine lösung finden konnte.
==see also==* unit propagation* boolean satisfiability problem* 2-satisfiability==references====further reading==
horn-formeln, die nur klauseln vom typ 2 besitzen, sind erfüllbar, indem man alle variablen mit 1 belegt.
* satisfiability: the boolean satisfiability problem for formulas in conjunctive normal form (often referred to as sat)** 0–1 integer programming** clique (see also independent set problem)*** set packing*** vertex cover**** set covering**** feedback node set**** feedback arc set**** directed hamilton circuit (karp's name, now usually called directed hamiltonian cycle)***** undirected hamilton circuit (karp's name, now usually called undirected hamiltonian cycle)** satisfiability with at most 3 literals per clause (equivalent to 3-sat)*** chromatic number (also called the graph coloring problem)**** clique cover**** exact cover***** hitting set***** steiner tree***** 3-dimensional matching***** knapsack (karp's definition of knapsack is closer to subset sum)****** job sequencing****** partition******* max cutas time went on it was discovered that many of the problems can be solved efficiently if restricted to special cases, or can be solved within any fixed percentage of the optimal result.
* satisfiability: das erfüllbarkeitsproblem der aussagenlogik für formeln in konjunktiver normalform** clique: cliquenproblem*** set packing: mengenpackungsproblem*** vertex cover: knotenüberdeckungsproblem**** set covering: mengenüberdeckungsproblem**** feedback arc set: feedback arc set**** feedback node set: feedback vertex set**** directed hamiltonian circuit: siehe hamiltonkreisproblem***** undirected hamiltonian circuit: siehe hamiltonkreisproblem** 0-1 integer programming: siehe integer linear programming** 3-sat: siehe 3-sat*** chromatic number: graph coloring problem**** clique cover: cliquenproblem**** exact cover: problem der exakten Überdeckung***** 3-dimensional matching: 3-dimensional matching (stable marriage mit drei geschlechtern)***** steiner tree: steinerbaumproblem***** hitting set: hitting-set-problem***** knapsack: rucksackproblem****** job sequencing: job sequencing****** partition: partitionsproblem******* max-cut: maximaler schnitt== literatur ==== einzelnachweise ==