In Boolean algebra, a switching function is a function that maps n binary variables to a single binary value. Typically it is thought of as assigning 0 or 1 to each binary sequence of length n.
| Property | Value |
|---|
| dbpprop:abstract
|
- In Boolean algebra, a switching function is a function that maps n binary variables to a single binary value. Typically it is thought of as assigning 0 or 1 to each binary sequence of length n.
|
| rdfs:comment
|
- In Boolean algebra, a switching function is a function that maps n binary variables to a single binary value. Typically it is thought of as assigning 0 or 1 to each binary sequence of length n.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
