Udvidet returret til d. 31. januar 2025

Feasible Computations and Provable Complexity Properties - Juris Hartmanis - Bog

Bag om Feasible Computations and Provable Complexity Properties

Provides an overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780898710274
  • Indbinding:
  • Paperback
  • Sideantal:
  • 69
  • Udgivet:
  • 1. januar 1987
  • Størrelse:
  • 152x229x8 mm.
  • Vægt:
  • 128 g.
  • Ukendt - mangler pt..

Normalpris

  • BLACK WEEK

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af Feasible Computations and Provable Complexity Properties

Provides an overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.

Brugerbedømmelser af Feasible Computations and Provable Complexity Properties



Find lignende bøger
Bogen Feasible Computations and Provable Complexity Properties findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.