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...
| Main Author: | Wegener, Ingo (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2005.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Complexity Theory Exploring the Limits of Efficient Algorithms
by: Wegener, Ingo
Published: (2005) -
Computer Science - Theory and Applications Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings /
Published: (2009) -
Logic, Language, Information and Computation 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings /
Published: (2010) -
Automated Technology for Verification and Analysis 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings /
Published: (2009) -
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity /
by: Zeume, Thomas
Published: (2017)