Kaikki kirjat 35 % 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

Weakly NP-Complete: Computational Complexity, NP-Complete, NP-Hard -

englanti
2026-03-20
138,79 € 213,53 €

-35% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

High Quality Content by WIKIPEDIA articles! In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard), if there is an algorithm for the problem whose running time is polynomial in the dimension of the problem and the magnitudes of the data involved (provided these are given as integers), rather than the base-two logarithms of their magnitudes. Such algorithms ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

High Quality Content by WIKIPEDIA articles! In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard), if there is an algorithm for the problem whose running time is polynomial in the dimension of the problem and the magnitudes of the data involved (provided these are given as integers), rather than the base-two logarithms of their magnitudes. Such algorithms are technically exponential functions of their input size and are therefore not considered polynomial. For example, the NP-hard knapsack problem can be solved by a dynamic programming algorithm requiring a number of steps polynomial in the size of the knapsack and the number of items (assuming that all data are scaled to be integers). This algorithm is exponential time since the input sizes of the objects and knapsack are logarithmic in their magnitudes.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786131194191
Kirjoita oma arvostelusi
Arvostelet: Weakly NP-Complete: Computational Complexity, NP-Complete, NP-Hard
Arvostelusi:

Goodreads-arvostelut

138,79 € 213,53 €