Download link:
.
.
==>
.
The Complexity of Boolean Functions by Ingo Wegener, ISBN-13: 978-0471915553
.
<==
.
.
"The Complexity of Boolean Functions" by Ingo Wegener explores the computational complexity associated with Boolean functions, examining their characteristics and behaviors in relation to algorithms and complexity theory. The book provides a comprehensive analysis of various computational models and measures, such as circuit complexity, formula complexity, and the role of Boolean functions in logic and computer science. Wegener delves into different classes of Boolean functions, discusses significant results and open problems in the field, and highlights the implications of these complexities for practical computing applications, making it a valuable resource for researchers and students interested in theoretical computer science and complexity theory.
.
Title: The Complexity of Boolean Functions
Author: Ingo Wegener
ISBN-13: 978-0471915553
Publisher: Wiley (1987)
Number of Pages: 304
Field: Computer Science, Complexity Theory
.
In "The Complexity of Boolean Functions," Ingo Wegener provides a rigorous and comprehensive exploration of the complexity measures associated with Boolean functions, delving into their significance in computer science and mathematics. The book systematically addresses fundamental concepts such as circuit complexity, decision trees, and the relationships between various complexity classes. Wegener employs clear definitions and detailed proofs, making complex theories accessible to readers. Additionally, the text includes numerous examples and exercises that reinforce the material, making it an invaluable resource for students and researchers alike. Ultimately, Wegener's work stands as a crucial contribution to the understanding of computational complexity and its implications in algorithmic design and analysis.
.
Group Admins
PDF: The Complexity of Boolean Functions by Ingo Wegener, ISBN-13: 978-0471915553
Sorry, there was no activity found. Please try a different filter.
