Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Search Problem: Computational Complexity Theory, Computability Theory, Decision Problem -

englanti
2026-03-15
146,80 € 195,73 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

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 occurr ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786131157059
Kirjoita oma arvostelusi
Arvostelet: Search Problem: Computational Complexity Theory, Computability Theory, Decision Problem
Arvostelusi:

Goodreads-arvostelut

146,80 € 195,73 €