Author: Ingo Wegener
Publisher:
ISBN:
Category : Algebra, Boolean
Languages : en
Pages : 502

Get Book Here

Book Description

Author: Peter Clote
Publisher: Springer Science & Business Media
ISBN: 3662049430
Category : Computers
Languages : en
Pages : 612

Get Book Here

Book Description
The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.

Author: Yves Crama
Publisher: Cambridge University Press
ISBN: 0521847524
Category : Computers
Languages : en
Pages : 781

Get Book Here

Book Description
A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.

Author: Ryan O'Donnell
Publisher: Cambridge University Press
ISBN: 1107038324
Category : Computers
Languages : en
Pages : 445

Get Book Here

Book Description
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.

Author: Claude Carlet
Publisher: Cambridge University Press
ISBN: 1108634664
Category : Computers
Languages : en
Pages : 577

Get Book Here

Book Description
Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications.

Author: Ingo Wegener
Publisher: SIAM
ISBN: 9780898719789
Category : Mathematics
Languages : en
Pages : 418

Get Book Here

Book Description
Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. This book is the first comprehensive description of theory and applications. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Author: Paul E. Dunne
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 526

Get Book Here

Book Description

Author: Sanjeev Arora
Publisher: Cambridge University Press
ISBN: 0521424267
Category : Computers
Languages : en
Pages : 609

Get Book Here

Book Description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

Author: Christophe Garban
Publisher: Cambridge University Press
ISBN: 1107076439
Category : Computers
Languages : en
Pages : 223

Get Book Here

Book Description
This is the first book to cover the theory of noise sensitivity of Boolean functions with particular emphasis on critical percolation.

Author: Avi Wigderson
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434

Get Book Here

Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography