Logo

Solving NP-Complete Problems

Small book cover: Solving NP-Complete Problems

Solving NP-Complete Problems
by

Publisher: University of Kentucky
Number of pages: 123

Description:
This is an on-line textbook on heuristic algorithms. From the table of contents: Classes of Problems; Integer Programming; Enumeration Techniques; Dynamic Programming; Approximate Solutions; Local Optimization; Natural Models.

This document is no more available for free.

Similar books

Book cover: Introduction to Complexity TheoryIntroduction to Complexity Theory
by
Complexity theory is the study of the intrinsic complexity of computational tasks. The book is aimed at exposing the students to the basic results and research directions in the field. The focus was on concepts, complex technical proofs were avoided.
(5226 views)
Book cover: Parallel Complexity TheoryParallel Complexity Theory
by - Prentice Hall
The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.
(4080 views)
Book cover: Specifying SystemsSpecifying Systems
by - Addison-Wesley Professional
This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.
(8123 views)
Book cover: Computability and ComplexityComputability and Complexity
- Wikibooks
This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is CS and Math students with some background in programming and data structures.
(3733 views)