Search results
Jump to navigation
Jump to search
- ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...24 KB (4,365 words) - 11:50, 5 June 2013
- ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...25 KB (4,389 words) - 09:05, 12 January 2011
- ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...25 KB (4,523 words) - 13:54, 27 December 2015
- ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...25 KB (4,408 words) - 01:20, 10 November 2011
- '''Special relativity''' (or '''the special theory of relativity''') is a theory in [[physics]] that was developed and explained by [[Albert Einstein]] in 1 ...ved in [[luminiferous aether]]. Various tiny effects were expected if this theory were true. Gradually it seemed these predictions were not going to work out ...15 KB (2,495 words) - 16:23, 9 April 2017
- ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...32 KB (5,780 words) - 13:32, 2 December 2017
- ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...32 KB (5,780 words) - 02:49, 24 November 2016
- ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...32 KB (5,780 words) - 07:54, 28 November 2019
- ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...32 KB (5,800 words) - 07:57, 21 May 2014
- *[[set theory]] *[[Banach space]] theory ...16 KB (2,241 words) - 05:01, 18 January 2017
- ...olecular orbital]]s. This is used in the [[Hückel method]], [[ligand field theory]], and the [[Woodward–Hoffmann rules]]. Another idea on a larger scale is t ...ic point groups was published in 1936 by Rosenthal and Murphy.<ref>''Group Theory and the Vibrations of Polyatomic Molecules'' Jenny E. Rosenthal and G. M. M ...19 KB (2,913 words) - 21:36, 4 November 2015
- ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...50 KB (8,991 words) - 12:23, 21 May 2023
- | title = Schaum's outline of theory and problems of linear algebra | title = Cauchy and the spectral theory of matrices ...13 KB (1,723 words) - 07:13, 11 November 2016
- ...en.wikipedia.org/wiki/Computational_learning_theory computational learning theory]. ...on is found by Vapnik and Chervonenkis, who use the framework to develop a theory of classifications. ...25 KB (4,480 words) - 04:58, 17 November 2010
- ...en.wikipedia.org/wiki/Computational_learning_theory computational learning theory]. ...on is found by Vapnik and Chervonenkis, who use the framework to develop a theory of classifications. ...25 KB (4,480 words) - 08:23, 16 August 2011
- == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...19 KB (3,610 words) - 14:17, 19 June 2013
- == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...19 KB (3,610 words) - 08:59, 28 May 2014
- ...4mhz.de/cook.html|title = Proceedings of the Third Annual ACM Symposium on Theory of Computing|pages = 151–158}}</ref> ...able to check <math>1,000,000</math> combinations per second using current systems.<!--How to remove the need for annual editorial review of this eventually o ...15 KB (2,427 words) - 22:24, 16 August 2017
- *The letters ''m'' and ''b'' are constants.<ref>{{cite book|title=Theory and Problems of Beginning Finite Mathematics|last1=Lipschutz|first1=Seymour ...his form is often used in [[geometry]] and in [[system of linear equations|systems of linear equations]]. ...14 KB (2,194 words) - 00:02, 2 January 2015
- == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...23 KB (4,382 words) - 05:07, 5 November 2010