Analysis of Boolean functions
In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on or (such functions are sometimes known as pseudo-Boolean functions) from a spectral perspective. The functions studied are often, but not always, Boolean-valued, making them Boolean functions. The area has found many applications in combinatorics, social choice theory, random graphs, and theoretical computer science, especially in hardness of approximation, property testing, and PAC learning.
Wikipage redirect
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Analysis of Boolean functions
In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on or (such functions are sometimes known as pseudo-Boolean functions) from a spectral perspective. The functions studied are often, but not always, Boolean-valued, making them Boolean functions. The area has found many applications in combinatorics, social choice theory, random graphs, and theoretical computer science, especially in hardness of approximation, property testing, and PAC learning.
has abstract
In mathematics and theoretical ...... rty testing, and PAC learning.
@en
Wikipage page ID
54,171,755
page length (characters) of wiki page
Wikipage revision ID
1,005,802,827
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In mathematics and theoretical ...... rty testing, and PAC learning.
@en
label
Analysis of Boolean functions
@en