|Listed in category:
Have one to sell?

COMPUTABILITY AND COMPLEXITY THEORY (TEXTS IN COMPUTER By Steven Homer & Alan L.

~ MINT Condition! Quick & Free Delivery in 2-14 days ~
US $70.95
ApproximatelyS$ 91.03
Condition:
Like New
Book is in Like New / near Mint Condition. Will include dust jacket if it originally came with ... Read moreabout condition
Breathe easy. Free shipping and returns.
Shipping:
Free Economy Shipping.
Located in: US, United States
Delivery:
Estimated between Wed, 20 Aug and Fri, 22 Aug to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Seller pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:186769973597
Last updated on Dec 18, 2024 12:02:47 SGTView all revisionsView all revisions

Item specifics

Condition
Like New
A book in excellent condition. Cover is shiny and undamaged, and the dust jacket is included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear. See all condition definitionsopens in a new window or tab
Seller Notes
“Book is in Like New / near Mint Condition. Will include dust jacket if it originally came with ...
ISBN-10
0387950559
Book Title
Computability and Complexity Theory (Texts in Computer Science)
Item Height
10 inches
ISBN
9780387950556

About this product

Product Identifiers

Publisher
Springer
ISBN-10
0387950559
ISBN-13
9780387950556
eBay Product ID (ePID)
1855890

Product Key Features

Number of Pages
Xiii, 194 Pages
Publication Name
Computability and Complexity Theory
Language
English
Publication Year
2001
Subject
Machine Theory, Computer Science, Logic
Type
Textbook
Subject Area
Mathematics, Computers
Author
Steven Homer, Alan L. Selman
Series
Graduate Texts in Computer Science
Format
Hardcover

Dimensions

Item Weight
22.6 Oz
Item Length
9.3 in
Item Width
7 in

Additional Product Features

Intended Audience
College Audience
LCCN
00-053829
Dewey Edition
21
Reviews
"The difference between this new introductory graduate textbook in theoretical computer science and other texts is that the authors have chosen to concentrate on computability theory and computational complexity theory. They motivate this focus by pointing out that most students have been introduced to the theory of automata and formal languages as undergraduates. The topics are treated in depth and in full formal detail. Explicit homework assignments are tightly integrated into the exposition of the material." --Computing Reviews
Illustrated
Yes
Dewey Decimal
004
Table Of Content
1. Preliminaries; 2. Introduction to Computability; 3. Undecidability; 4. Introduction to Complexity Theory; 5. Basic Results; 6. Nondeterminism and NP-Completeness; 7. Relative Computability
Synopsis
The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations, and the efficiency of the computations. It provides tools to measure the difficulty of combinatorial problems both absolutely, and in comparison with other problems. This book contains material that should be core knowledge in the theory of computation for all graduate students in computer science. This comprehensive introduction begins with classical computability theory and develops complexity theory on top of that., 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.
LC Classification Number
QA76.H6236 2001

Item description from the seller

About this seller

ZUBER

97.9% positive feedback968K items sold

Joined Oct 1998

Detailed Seller Ratings

Average for the last 12 months
Accurate description
4.8
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
4.9

Popular categories from this store

Seller feedback (296,751)

All ratings
Positive
Neutral
Negative