It's Raining Books Sale
 
 

Recently Viewed clear list


Interviews | September 2, 2014

Jill Owens: IMG David Mitchell: The Powells.com Interview



David MitchellDavid Mitchell's newest mind-bending, time-skipping novel may be his most accomplished work yet. Written in six sections, one per decade, The Bone... Continue »
  1. $21.00 Sale Hardcover add to wish list

    The Bone Clocks

    David Mitchell 9781400065677

spacer

On Order

$108.50
New Trade Paper
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Personal Computers- General

This title in other editions

Computability and Complexity Theory (Texts in Computer Science)

by

Computability and Complexity Theory (Texts in Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

This volume introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability round off the work, which focuses on the limitations of computability and the distinctions between feasible and intractable. Topics and features: *Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes *Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner; for example, about complements of complexity classes, search problems, and intermediate problems in NP *Provides key mathematical background information, including sections on logic and number theory and algebra *Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool.

Synopsis:

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.

Table of Contents

1. Preliminaries; 2. Introduction to Computability; 3. Undecidability; 4. Introduction to Complexity Theory; 5. Basic Results; 6. Nondeterminism and NP-Completeness; 7. Relative Computability

Product Details

ISBN:
9781441928658
Author:
Homer, Steven
Publisher:
Springer
Author:
Selman, Alan L.
Subject:
Computer Science
Subject:
Computation by Abstract Devices
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Personal Computers-General
Copyright:
Edition Description:
1st Edition. Softcover version of original hardcover edition 2001
Series:
Texts in Computer Science
Publication Date:
20101123
Binding:
TRADE PAPER
Language:
English
Pages:
207
Dimensions:
235 x 178 mm 376 gr

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Mathematics » General

Computability and Complexity Theory (Texts in Computer Science) New Trade Paper
0 stars - 0 reviews
$108.50 Backorder
Product details 207 pages Springer - English 9781441928658 Reviews:
"Synopsis" by , Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.