This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Analysis_of_Boolean_functions
rdfs:label
Analysis of Boolean functions
rdfs:comment
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.
dcterms:subject
dbc:Boolean_algebra dbc:Mathematical_optimization dbc:Theoretical_computer_science
dbo:wikiPageID
54171755
dbo:wikiPageRevisionID
1112205818
dbo:wikiPageWikiLink
dbr:Logarithmic_Sobolev_inequalities dbr:Gaussian_measure dbr:Maximum_cut dbr:Lp_space dbr:Condorcet_criterion dbr:Lipschitz_continuity dbr:Ornstein–Uhlenbeck_process dbr:Combinatorics dbr:Random_graph dbr:Discrete_Laplace_operator dbr:Theoretical_computer_science dbr:Continuous-time_Markov_chain dbr:Group_(mathematics) dbr:Fourier_transform dbr:Discrete_uniform_distribution dbr:Cumulative_distribution_function dbr:Semidefinite_programming dbc:Boolean_algebra dbr:Hermite_polynomials dbr:Mehler_kernel dbr:Boolean_function dbr:Property_testing dbr:Social_choice_theory dbr:Arrow's_impossibility_theorem dbr:Berry–Esseen_theorem dbr:Percolation dbr:Probably_approximately_correct_learning dbr:Unique_games_conjecture dbr:Functional_analysis dbr:Mathematics dbc:Mathematical_optimization dbr:Pseudo-Boolean_function dbc:Theoretical_computer_science dbr:Expected_value dbr:Hadamard_transform dbr:Hardness_of_approximation dbr:Hamming_graph
owl:sameAs
n13:4Xccz wikidata:Q48996110
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description
dbo:abstract
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.
prov:wasDerivedFrom
wikipedia-en:Analysis_of_Boolean_functions?oldid=1112205818&ns=0
dbo:wikiPageLength
29356
foaf:isPrimaryTopicOf
wikipedia-en:Analysis_of_Boolean_functions