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
Rating:
516.99 Lei
Disponibilitate : La comanda

Stocul este limitat la furnizorii nostri. Disponibilitatea si termenul de livrare va vor fi comunicate telefonic in maxim 48 de ore. Puteti anula comanda in cazul in care informatiile furnizate nu va sunt convenabile.