Complexity theory. Limits of the efficiency of algorithms

zbMath1055.68057MaRDI QIDQ1395898

Ingo Wegener

Publication date: 2 July 2003

Published in: Springer-Lehrbuch (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsrandomized algorithmscomplexity classestheory of computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Bounding the Running Time of Algorithms for Scheduling and Packing Problems

This page was built for publication: Complexity theory. Limits of the efficiency of algorithms