Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Loading
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Buy

Few technical lerms have gained such rapid notoriety as the appela tion "NP-complete." In the short lime since its introduction in the early 1970's, this term has come to symbolize the abyss of inherent intractability that algorithm designers increasingly face as they seek to solve larger and more complex problems. A wide variety of commonly encountered prob lems from mathematics, computer science, and operations research are now known to be NP-compIete, and the collection of such problems continues to grow almost daily. Indeed, the NP-complete problems are now so pervasive that it is important for anyone concerned with the computational aspects of these fields to be familiar with the meaning and implications of this concept

This book is intended as a detailed guide to the theory of NP- completeness, emphasizing those concepts and techniques that seem to be most useful for applying the theory to practical problems. It can be viewed as consisting of three parts.

The first part, Chapters 1 through 5, covers the basic theory of NP- completeness. Chapter 1 presents a relatively low-level introduction to some of the central notions of computational complexity and discusses the significance of NP-compleieness in this context. Chapters 2 through 5 pro vide the detailed definitions and proof techniques necessary for thoroughly understanding and applying the theory.

The second part. Chapters 6 and 7, provides an overview of two al ternative directions for further study. Chapter 6 concentrates on the search for efficient "approximation" algorithms for NP-complete problems, an area whose development has seen considerable interplay with the theory of NP- completeness. Chapter 7 surveys a large number of theoretical topics in computational complexity, many of which have arisen as a consequence of previous work on NP-completeness. Both of these chapters (especially Chapter 7) are intended solely as introductions to these areas, with our ex pectation being that any reader wishing to pursue particular topics in more detail will do so by consulting the cited references.

The third and final part of the book is the Appendix, which contains an extensive list (more than 300 main entries, and several times this many results in total) of NP-complete and NP-hard problems. Annotations to the main entries discuss what is known about the complexity of subproblems and variants of the stated problems.

(HTML tags aren't allowed.)

The Algorithms and Principles of Non-photorealistic Graphics: Artistic Rendering and Cartoon Animation
The Algorithms and Principles of Non-photorealistic Graphics: Artistic Rendering and Cartoon Animation

Non-photorealistic computer graphics is a multidisciplinary field in the research community, involving computer arts, computer graphics, computer vision, digital image/video processing and visual cognitive psychology. It aims at the computer generation of images and animations that are made in part “by hand” in appearance,...

XML in Office 2003: Information Sharing with Desktop XML
XML in Office 2003: Information Sharing with Desktop XML

What do you give the software that has everything?

XML, of course!

Microsoft Office is the most successful productivity product in the history of computers, with over 300 million users around the world. Few of them use all of the features in Office now, so why add...

Exploratory Programming for the Arts and Humanities (MIT Press)
Exploratory Programming for the Arts and Humanities (MIT Press)

This book introduces programming to readers with a background in the arts and humanities; there are no prerequisites, and no knowledge of computation is assumed. In it, Nick Montfort reveals programming to be not merely a technical exercise within given constraints but a tool for sketching, brainstorming, and inquiring about important topics....


Debugging by Thinking : A Multidisciplinary Approach (HP Technologies)
Debugging by Thinking : A Multidisciplinary Approach (HP Technologies)

Debugging by Thinking: A Multidisciplinary Approach uses the methods of literary detectives such as Sherlock Holmes, the techniques of mathematical problem solving, the results of research into the cognitive psychology of human error, the root cause analyses of safety experts, the compiler analyses of computer science, and the...

Dart for Absolute Beginners
Dart for Absolute Beginners

Dart for Absolute Beginners enables individuals with no background in programming to create their own web apps while learning the fundamentals of software development in a cutting edge language. Easily digested chapters, while comprehensive enough to explore the whole domain, are aimed at both hobbyists and professionals alike. The...

Learn You a Haskell for Great Good!: A Beginner's Guide
Learn You a Haskell for Great Good!: A Beginner's Guide

It's all in the name: Learn You a Haskell for Great Good! is a hilarious, illustrated guide to this complex functional language. Packed with the author's original artwork, pop culture references, and most importantly, useful example code, this book teaches functional fundamentals in a way you never thought...

©2017 LearnIT (support@pdfchm.net) - Privacy Policy