• Title Solving NP-Complete Problems
• Author(s) Forbes D. Lewis
• Publisher: University of Kentucky (2013 - Date)
• Paperback N/A
• eBook Online, HTML and PDF
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book 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.

It provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book,

• N/A

• Amazon

• Data Structures and Algorithms
• Computational Complexity
• Mathematical Logic - Set Theory, Model Theory, Computability, etc
• Theory of Computation

• Solving NP-Complete Problems (Forbes D. Lewis)
• The Mirror Site (1) - PDF
• NP-Hard Problems: An Introduction (Jeff Erickson)
• NP-Completeness (Hans L. Bodlaender, et al.)
• Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems (Nina Taslaman)

• P, NP, and NP-Completeness: The Basics of Complexity

  The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.

• Mathematics and Computation (Avi Wigderson)

  This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

• Think Complexity: Science and Modeling, 2nd Ed. (Allen Downey)

  This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. It presents features that make Python such a simple and powerful language. Code with a solution for each exercise.

• Complexity Theory: A Modern Approach (Sanjeev Arora, et al)

  This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation.

• Computability and Complexity: From a Programming Perspective

  This book is an introduction to the basic concepts of computability, complex, and the theory of programming languages. Its goal is to build a bridge between computability and complexity theory and other areas of computer science, especially programming.

• Traveling Salesman Problem, Theory and Applications

  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem, including Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm.

• The Complexity of Boolean Functions (Ingo Wegener)

  Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. It presents a large number of recent research results f Boolean functions previously unavailable in book form.

• Computational Complexity: A Conceptual Perspective (Goldreich)

  This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study.

• Algorithms and Complexity (Herbert S. Wilf)

  This is an introductory book on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis.