Marknadens största urval
Snabb leverans
Om Parameterized Complexity

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781461267980
  • Format:
  • Häftad
  • Sidor:
  • 533
  • Utgiven:
  • 8. oktober 2012
  • Utgåva:
  • 11999
  • Mått:
  • 155x235x28 mm.
  • Vikt:
  • 836 g.
Leveranstid: 2-4 veckor
Förväntad leverans: 18. december 2024

Beskrivning av Parameterized Complexity

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Användarnas betyg av Parameterized Complexity



Hitta liknande böcker
Boken Parameterized Complexity finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.