Computational Complexity
88% of respondents would recommend this to a friend
RSD 10747
Price Details
Excluding Shipping & Custom charges ( Shipping and custom charges will be calculated on checkout )
*All items will import from SAD
QTY:
Ubuy works hard to protect your security and privacy. Our advanced payment security system ensures confidentiality by encrypting your information during transmission using AES (Advanced Encryption Standards) and SSL (Secure Socket Layer) protocols. Your payment details are 100% secure as we do not share your payment details with third party sellers.
A comprehensive and accessible treatment of the theory of algorithms and complexity
Fast
Shipping
Free
Return*
Secure Packaging
100% Original Products
PCI DSS Compliance
ISO 27001 Certified
What Stands Out
Детаљи о производу
- Comprehensive and accessible treatment of the theory of algorithms and complexity
- Covers topics like reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems
- Provides a unified introduction to computational complexity integrating computation, applications, and logic
- Includes an accessible introduction to logic, Boolean logic, first-order logic, and second-order logic
- Presents extensive exercises with historical notes, references, and challenging problems
- Develops all necessary mathematical prerequisites from diverse fields such as computability, logic, number theory, combinatorics, and probability
| Publisher | Pearson |
| Publication date | November 30, 1993 |
| Edition | 1st |
| Language | English |
| Print length | 523 pages |
| ISBN-10 | 0201530821 |
| ISBN-13 | 978-0201530827 |
| Item Weight | 1.85 pounds (840 grams) |
| Dimensions | 1.1 x 6.1 x 8.9 inches (2.8 x 15.5 x 22.6 cm) |
| Country of Origin | This item will be imported from US |
| Date First Available | April 23, 2021 |
| What is in the box | Computational Complexity... For more details, please check description/product details |
Who Should Buy?
-
Computer Scientists
Ideal for those studying theoretical computer science, especially topics on algorithm efficiency and resource usage.
-
Graduate Students
Beneficial for graduate students specializing in algorithms, needing in-depth understanding of complexity classes and proofs.
-
Software Engineers
Useful for software engineers aiming to optimize algorithms and improve system performances through complexity analysis.
-
Casual Learners
Not suitable for general readers or casual learners seeking a basic understanding of computer science concepts.
OPIS PROIZVODA
Computational Complexity
About This Item
Introducing "Computational Complexity: 1st Edition" - the ultimate guide to understanding the theory of algorithms and complexity. This comprehensive and accessible textbook presents an elegant collection of concepts and methods developed by computer scientists over the past 30 years. Dive into the fascinating world of algorithm performance and limitations with this essential resource. This book covers a wide range of topics, including reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems.
Delve into circuit complexity, the structural aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many more intriguing subjects. What sets "Computational Complexity: 1st Edition" apart is its ability to present sophisticated and recent results in a simple and approachable manner. While some complex topics are explained concisely, others are explored through extensive notes, problems, and hints. The book also ensures that readers have all the necessary mathematical prerequisites, drawing from diverse fields such as computability, logic, number theory, combinatorics, and probability. Key features of "Computational Complexity: 1st Edition" include: 1.
Unified Introduction: This is the first book to provide a unified introduction to computational complexity. Gain a deep understanding of this field through its integration with computation, applications, and logic. 2. Accessible Logic: Boost your understanding of logic with the book's approachable introduction to Boolean logic, first-order logic, and second-order logic. 3.
Extensive Exercises: Reinforce your learning with the book's extensive exercises. Historical notes, references, and challenging problems accompany each chapter. Whether you're a student, researcher, or simply curious about computational complexity, this book is your go-to resource. Get your copy of "Computational Complexity: 1st Edition" and embark on a journey into the fascinating world of algorithms, complexity, and computation. Keywords: computational complexity book, 1st edition computational complexity, computational complexity textbook, computational complexity theory, computational complexity problems, introduction to computational complexity, complexity theory book, 1st edition book on computational complexity, advanced computational complexity, computational complexity and algorithms, computational complexity analysis, computational complexity classes, computational complexity algorithms, computational complexity examples, computational complexity research, computational complexity notes, computational complexity lectures.
Питања и одговори купаца
-
Pitanje:
Како купити Computational Complexity на мрежи од Убуи-а?
Odgovor: Лако је куповати Computational Complexity на мрежи од Убуи-а.. Морате само да потражите производ, изаберете начин испоруке приликом одјављивања и да га испоручите на вашу локацију. -
Pitanje:
Да ли је Computational Complexity доступан за онлајн куповину у Serbia?
Odgovor: Да, у Убуи Serbia овај производ је доступан за куповину по разумној цени.. Computational Complexity није доступан локално, али можете нам веровати у наше услуге експресне испоруке. -
Pitanje:
Колико времена је потребно да се производ добије након наручивања?
Odgovor: Време испоруке вашег нарученог производа варира у зависности од тога шта сте наручили и начина испоруке који сте изабрали.. Процењено време испоруке се помиње током процеса плаћања, па будите безбрижни док купујете.
Computer Science Editorial Review
Computational Complexity is a comprehensive guide published by Pearson, providing an in-depth exploration of computational theory. The first edition, released on November 30, 1993, spans 523 pages, making it an essential resource for students and professionals in the field. It delves into various complexities, offering insights that are both theoretical and practical. Reviewers appreciate its thorough explanations and well-structured content, often highlighting its clarity in discussing intricate concepts. This book is perfect for those seeking to deepen their understanding of computational problems and their solutions.
Customer Reviews & Ratings
-
5 zvezda
100%
-
4 zvezda
0%
-
3 zvezda
0%
-
2 zvezda
0%
-
1 zvezda
0%
Ocenite ovaj proizvod
Podelite svoja razmišljanja sa drugim kupcima
Прос
- Comprehensive coverage of computational theory
- Clear explanations of complex concepts
- Well-structured and easy to follow
- Useful for students and professionals
- Published by a reputable publisher
Цонс
- Some readers may find it a bit dense for casual reading
Product Price History
Važna informacija
- Ograničenja: Za proizvode koji se isporučuju međunarodno, imajte na umu da garancija proizvođača možda neće biti važeća; opcije servisiranja proizvođača možda neće biti dostupne; priručnici za proizvode, uputstva i upozorenja o bezbednosti možda nisu na jezicima zemlje odredišta; proizvodi (i prateći materijali) ne moraju biti dizajnirani u skladu sa standardima zemlje odredišta, specifikacijama i zahtevima za označavanje; a proizvodi možda nisu u skladu sa naponom zemlje odredišta i drugim električnim standardima (zahteva se upotreba adaptera ili pretvarača ako je potrebno). Primalac je odgovoran za osiguranje da se proizvod može zakonito uvesti u odredišnu zemlju. Prilikom naručivanja od kompanije Ubuy ili njegovih podružnica, primalac je nadležni uvoznik i mora se pridržavati svih zakona i propisa zemlje odredišta.
- Nisu svi proizvodi navedeni na Ubuy-u na prodaju, jer je Ubuy globalni pretraživač. Proizvodi podležu izvoznim/trgovačkim propisima.
RSD 10747
Naručite sada i dobijte oko Subota, Oktobar 24
This item is not restrict in my country.(Please click on above link if this item is not restrict in your country, So our team will review and allow.)
QTY:
PCI DSS compliant and ISO 27001:2022 certified, with encrypted payments and full buyer protection on every order.
Карактеристике и предности
- Provides a comprehensive overview of algorithm theory and complexity
- Covers topics such as reductions and NP-completeness, cryptography and protocols, and randomized algorithms
- Presents recent results in a simple manner and offers extensive notes, problems, and hints
- Self-contained book that develops necessary mathematical prerequisites
- Suitable for both beginners and advanced learners in computer science
- Accessible and understandable language throughout the book
Ubuy Assurance
Experience worry-free shopping with 100% original products, PCI DSS-compliant payment security, ISO 27001-certified data protection, the fastest cross-border delivery, free returns *, and secure packaging on every order.