Theory of Semi-feasible Algorithms

Lane A. Hemaspaandra , Leen Torenvliet

This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness.
  • Limba : Engleza
  • Data Publicarii : 28 Oct 2002
  • Format : Hardback
  • Numar pagini : 160
  • ISBN : 9783540422006
516.99 Lei
Disponibilitate : 2-4 saptamani

Acest produs este disponibil in stocul furnizorilor si poate fi livrat in 2-4 saptamani