Inhaltsangabe
This book introduces some of the most important results their computer science. These " gems " are central problems and their solutions from the areas of computability, logic, circuit theory, and computational complexity. The text retraces the (sometimes unexpected) solutions to once open problems, clearly presenting complete proofs of often complex results on lower bounds, probabilistic constructions, quantum computation, and much more. More than 270 exercises (elegant solutions for which are provided) form an integral part of the text and challenge the reader to join in working through the results presented here.
Von der hinteren Coverseite
This book introduces some of the most important results in theoretical computer science. The "gems" are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and much, much more. With over 240 intriguing exercises (elegant solutions for which are supplied), the text also challenges the reader to do some active work.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.