Computational Complexity
88% av respondentene vil anbefale dette til en venn
NOK 1039
Prisdetaljer
Eksklusive frakt- og tollkostnader ( Frakt- og tollkostnader beregnes ved kassen )
*Alle varer importeres fra USA
Antall:
Ubuy arbeider hardt for å beskytte din sikkerhet og personvern. Vårt avanserte betalingssikkerhetssystem sikrer konfidensialitet ved å kryptere informasjonen din under overføring ved hjelp av AES (Advanced Encryption Standards) og SSL (Secure Socket Layer)-protokoller. Betalingsopplysningene dine er 100 % sikre da vi ikke deler betalingsopplysningene dine med tredjepartsselgere.
A comprehensive and accessible treatment of the theory of algorithms and complexity
Fast
Shipping
Gratis
retur*
Sikret innpakking
100 % originale produkter
PCI DSS-samsvar
ISO 27001-sertifisert
Produkt detaljer
- 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 |
PRODUKTBESKRIVELSE
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.
Kundespørsmål og svar
-
Spørsmål:
Hvordan handle Computational Complexity online fra Ubuy?
Svar: Det er enkelt å handle Computational Complexity online fra Ubuy.. Du trenger bare å søke etter produktet, velge fraktmetode mens du sjekker ut og få det levert til ditt sted. -
Spørsmål:
Er Computational Complexity tilgjengelig for nettbutikk i Norway?
Svar: Ja, hos Ubuy Norway er dette produktet tilgjengelig for deg å handle til en rimelig pris.. Computational Complexity er ikke tilgjengelig lokalt, men du kan stole på oss med våre ekspressfrakttjenester. -
Spørsmål:
Hvor lang tid tar det å få produktet etter bestillingen?
Svar: Leveringstiden for det bestilte produktet ditt varierer i henhold til hva du har bestilt og fraktmetoden du har valgt.. Den estimerte leveringstiden er nevnt under utsjekkingsprosessen, så vær bekymringsløs mens du handler.
Computer Science Editorial Review
Computational Complexity 1st Edition is a comprehensive book on complexity theory, specifically targeting a graduate school level audience. The content is well-explained and covers a wide range of topics in computational theory. It is recommended for those with a strong background in math and computer science theory, as the subject matter can be quite abstract and may require advanced reasoning skills to fully grasp. The book is Considered to be excellent by those within the field, and it is highly recommended for anyone interested in complexity theory. It is particularly useful for individuals who have already read Sipser's book and are looking for further exercises and knowledge in the field. While the book is a good introductory resource for students in computer science, it may not be as valuable for advanced researchers in theoretical computer science. Some reviewers felt that the content is shallow compared to Martin Davis's book, and that it does not include the latest results in the field. Additionally, it is worth noting that the book should be purchased at a reasonable price and should not be confused with a cheaper version under the same title. Overall, Computational Complexity 1st Edition is a well-presented book that covers the fundamentals of computational theory. It is suitable for self-study and provides a solid foundation for those interested in the field.
Kundeanmeldelser og vurderinger
-
5 stjerne
100%
-
4 stjerne
0%
-
3 stjerne
0%
-
2 stjerne
0%
-
1 stjerne
0%
Vurder dette produktet
Del tankene dine med andre kunder
Fordeler
- Comprehensive coverage of complexity theory
- Well-explained concepts
- Suitable for self-study
Ulemper
- May be difficult to follow without strong training in math and computer science theory
Produktets prishistorikk
Viktig informasjon
- Begrensninger: For produkter som sendes internasjonalt, vær oppmerksom på at eventuell produsentgaranti kan være ugyldig; produsentens serviceordninger er kanskje ikke tilgjengelige; produktmanualer, instruksjoner og sikkerhetsadvarsler er kanskje ikke på mottakerlandets språk; produktene (og medfølgende materiell) er kanskje ikke utformet i samsvar med mottakerlandets standarder, spesifikasjoner og merkekrav; og produktene samsvarer kanskje ikke med mottakerlandets krav til spenning og andre elektriske standarder (noe som kan kreve bruk av adapter eller omformer om nødvendig). Mottakeren er ansvarlig for å sikre at produktet lovlig kan importeres til mottakerlandet. Ved bestilling fra Ubuy eller dets datterselskaper er mottakeren registrert importør og må overholde alle lover og forskrifter i mottakerlandet.
- Ikke alle produkter som er oppført på Ubuy er til salgs, da Ubuy er en global søkemotor. Produkter er underlagt eksport-/handelsreguleringer.
NOK 1039
Bestill nå, så får du den omkring Sunday, Oktober 25
Denne varen er ikke underlagt restriksjoner i mitt land. (Klikk på lenken over hvis varen ikke er begrenset i ditt land, så vil teamet vårt vurdere og godkjenne den.)
Antall:
PCI DSS-kompatibel og ISO 27001:2022-sertifisert, med krypterte betalinger og full kjøperbeskyttelse på hver bestilling.
Funksjoner og fordeler
- 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-garanti
Opplev bekymringsfri shopping med 100 % originale produkter, PCI DSS-kompatibel betalingssikkerhet, ISO 27001-sertifisert databeskyttelse, den raskeste grensekryssende leveringen, gratis retur, og sikker emballasje på hver bestilling.*