In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the permutation of its input bits, i.e. , it depends only on the number of ones in the input. The definition implies that instead of the truth table, traditionally used to represent Boolean functions, one may use a a more compact representation for an n-variable symmetric Boolean function: the (n + 1)-vector, whose i-th entry (i = 0, ...

PropertyValue
dbpprop:abstract
  • In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the permutation of its input bits, i.e. , it depends only on the number of ones in the input. The definition implies that instead of the truth table, traditionally used to represent Boolean functions, one may use a a more compact representation for an n-variable symmetric Boolean function: the (n + 1)-vector, whose i-th entry (i = 0, ... , n) is the value of the function on an input vector with i ones.
rdfs:comment
  • In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the permutation of its input bits, i.e. , it depends only on the number of ones in the input. The definition implies that instead of the truth table, traditionally used to represent Boolean functions, one may use a a more compact representation for an n-variable symmetric Boolean function: the (n + 1)-vector, whose i-th entry (i = 0, ...
rdfs:label
  • Symmetric Boolean function
skos:subject
foaf:page