TOP
💡 邁向小一的第一步!給孩子一本「查得到自信」的專屬辭典,輕鬆跨越閱讀關卡!🚀
搜尋結果 /

Boolean Functions

9
1 / 1
出版日:2021/07/19 作者:Tharrmashastha Sapv  出版社:Springer Nature  裝訂:平裝
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Noise Sensitivity of Boolean Functions and Percolation
滿額折
出版日:2014/10/31 作者:Christophe Garban  出版社:Cambridge Univ Pr  裝訂:平裝
This is a graduate-level introduction to the theory of Boolean functions, an exciting area lying on the border of probability theory, discrete mathematics, analysis, and theoretical computer science. Certain functions are highly sensitive to noise; this can be seen via Fourier analysis on the hypercube. The key model analyzed in depth is critical percolation on the hexagonal lattice. For this model, the critical exponents, previously determined using the now-famous Schramm–Loewner evolution, appear here in the study of sensitivity behavior. Even for this relatively simple model, beyond the Fourier-analytic set-up, there are three crucially important but distinct approaches: hypercontractivity of operators, connections to randomized algorithms, and viewing the spectrum as a random Cantor set. This book assumes a basic background in probability theory and integration theory. Each chapter ends with exercises, some straightforward, some challenging.
優惠價: 9 994
無庫存
出版日:2009/12/15 作者:J. Donald Monk  出版社:Springer Verlag  裝訂:平裝
This book is concerned with cardinal number valued functions defined for any Boolean algebra. Examples of such functions are independence, which assigns to each Boolean algebra the supremum of the car
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2017/04/10 作者:Thomas W. Cusick; Pantelimon Stanica  出版社:Academic Pr  裝訂:平裝
Cryptographic Boolean Functions and Applications 2nd edition is designed to be a comprehensive reference for the use of Boolean functions in modern cryptography. While the vast majority of research on
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2015/06/01 作者:Natalia Tokareva  出版社:Academic Pr  裝訂:平裝
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. These maximal, nonlinear Boolean functions and t
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Theories of Computability
90 折
出版日:2010/06/10 作者:Nicholas Pippenger  出版社:Cambridge Univ Pr  裝訂:平裝
This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.
優惠價: 9 2281
無庫存
A Short Course In Discrete Mathematics
滿額折
出版日:2004/12/13 作者:Edward A. Bender; S. Gill Williamson  出版社:Dover Pubns  裝訂:平裝
This undergraduate-level describes the mathematics most needed in computer science. Bender and Williamson (both mathematics, U. of California, San Diego) cover Boolean functions and computer arithmeti
優惠價: 9 545
無庫存
Mathematics for Electrical Engineering and Computing
95 折
出版日:2003/08/26 作者:Mary Attenborough  出版社:Butterworth-Heinemann  裝訂:平裝
Mathematics for Electrical Engineering and Computing embraces many applications of modern mathematics, such as Boolean Algebra and Sets and Functions, and also teaches both discrete and continuous sys
優惠價: 95 3417
無庫存
出版日:1989/08/30 作者:Mauricio Karchmer  出版社:Mit Pr  裝訂:平裝
Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for alm
  • 9
    1

暢銷榜

客服中心

收藏

會員專區