Complexity Theory Exploring the Limits of Efficient Algorithms /
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook consi...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Wegener, Ingo (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2005.
|
Edición: | 1st ed. 2005. |
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Computer Science - Theory and Applications Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings /
Publicado: (2009) -
Reachability Problems 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings /
Publicado: (2014) -
Developments in Language Theory 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012, Proceedings /
Publicado: (2012) -
Mathematics in Computing An Accessible Guide to Historical, Foundational and Application Contexts /
por: O'Regan, Gerard
Publicado: (2013) -
Computer Science Logic 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings /
Publicado: (2009)