Jump to content

Switching function

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Joy (talk | contribs) at 08:18, 4 June 2010 (fixed broken .yu link -> working .rs link; formatted journal reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

  • Janković, Dragan; Stanković, Radomir S.; Moraga, Claudio (November 2003). "Arithmetic Expressions Optimisation Using Dual Polarity Property" (PDF). Serbian journal of electrical engineering. 1 (71–80). Retrieved 2010-04-06. {{cite journal}}: More than one of |number= and |issue= specified (help)
  • http://www.answers.com/topic/switching-function?cat=technology
  • http://www-cse.uta.edu/~carroll/cse2341/summer99/powerpoint%20files/chapter_2.ppt
Stub icon

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Switching_function&oldid=365982901"