Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems.
Divided into three parts, it covers:
- Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined.
- Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity.
- Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form.
Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest.
The book, Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) [Bulk, Wholesale, Quantity] ISBN#9781447110521 in Paperback by Richard Lassaigne, Michel de Rougemont may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Springer London
- Authors
- Richard Lassaigne, Michel de Rougemont
- Format
- Paperback
- Published
- Oct 8, 2012
- ISBN-13
- 9781447110521
- Pages
- 361
- Printing
- Printed on demand
Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $158.39 | 12% off list |
| 50 – 99 | $156.59 | 13% off list |
| 100+ | $154.79 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
How fast can I get copies of Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
What buyers say
Write a Review
Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) [9781447110521]
Groups also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.