Search results

From Self-sufficiency
Jump to: navigation, search
  • * [[Bayes' theorem]] — In [[probability theory]], shows the relation between one conditional probability and its inverse. ...mann's limit]] — Named after [[Hans-Joachim Bremermann]], is the maximum computational speed of a self-contained system in the material universe.
    35 KB (5,195 words) - 20:06, 21 September 2010
  • A '''Wallace tree''' is an [[Computational complexity theory|efficient]] [[Computer hardware|hardware]] implementation of a digital circ ...pective, the Wallace tree algorithm puts multiplication in the class [[NC (complexity)|NC<sup>1</sup>]].
    5 KB (812 words) - 17:11, 9 December 2011
  • ...dy in [[circuit complexity]] and are a special kind of [[circuit (computer theory)|circuit]]s; a [[formal language]] can be decided by a family of Boolean ci ...ize, and number of alternations. In a circuit family, we consider the size complexity of a family, for example, to be the function of n that gives the size of th
    3 KB (454 words) - 17:11, 9 December 2011
  • {{mergeto|Computational electromagnetics|discuss=Talk:Computational electromagnetics#Merger proposal|date=August 2010}} electromagnetic complexity has grown as well, from [[Electrical resistance|resistance]] and [[capacita
    8 KB (1,138 words) - 13:47, 10 December 2011
  • ...with [[transmission line]]s. Transmission line theory gave rise to filter theory, which initially took a very similar form, and the main application of filt ...ultiplexing]]. Network analysis was not yet powerful enough to provide the theory for more complex filters and progress was further hampered by a general fai
    60 KB (9,254 words) - 13:49, 10 December 2011