Lesson plan
Pseudo-Boolean function
In mathematics and optimization, a pseudo-Boolean function is a function of the form : f: \mathbf{B}^n \to \R, where is a Boolean domain and is a nonnegative integer called the arity of the function. A Boolean function is then a special case, where the values are also restricted to 0 or 1.
Article summary
In mathematics and optimization, a pseudo-Boolean function is a function of the form : f: \mathbf{B}^n \to \R, where is a Boolean domain and is a nonnegative integer called the arity of the function. A Boolean function is then a special case, where the values are also restricted to 0 or 1.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.