Boolean Function Complexity -
-25% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas politika
Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significan ... Pilns apraksts
Jums varētu patikt arī
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altmans OpenAI
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Slanted 47 Digital Tools: Slanted Magazine
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Automate the Boring Stuff with Python
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-25% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-25% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists working in related areas.
Vairāk informācijas
| Izdevējs | Cambridge University Press |
|---|---|
| Izlaides gads | 2005 |
| Vāka tips | Mīkstais vāks |
| EAN | 9780521408264 |