Search Problem
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding a structure y into an object x. An algorithm is said to solve the problem if it behaves in the following way : if at least one corresponding structure exists, then one occurrence of this structure is outputted; otherwise, the algorithm stops with an appropriate output ("Item not found" or any message of the like). For instance, such problems occurs very…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding a structure y into an object x. An algorithm is said to solve the problem if it behaves in the following way : if at least one corresponding structure exists, then one occurrence of this structure is outputted; otherwise, the algorithm stops with an appropriate output ("Item not found" or any message of the like). For instance, such problems occurs very frequently in graph theory, where searching graphs for structures such as particular matching, cliques, independent set, etc. are subjects of interest.