De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
Levering: 1 - 2 hverdage
Bag 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781461267980
  • Indbinding:
  • Paperback
  • Sideantal:
  • 533
  • Udgivet:
  • 8. oktober 2012
  • Udgave:
  • 11999
  • Størrelse:
  • 155x235x28 mm.
  • Vægt:
  • 836 g.
  • 8-11 hverdage.
  • 10. december 2024
På lager
Forlænget returret til d. 31. januar 2025

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

Beskrivelse af 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.

Brugerbedømmelser af Parameterized Complexity



Find lignende bøger
Bogen Parameterized Complexity findes i følgende kategorier: