Matches in DBpedia 2014 for { <http://dbpedia.org/resource/1/3–2/3_conjecture> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- 3_conjecture abstract "In order theory, a branch of mathematics, the 1/3–2/3 conjecture states that, if one is comparison sorting a set of items then, no matter what comparisons may have already been performed, it is always possible to choose the next comparison in such a way that it will reduce the number of possible sorted orders by a factor of 2/3 or better. Equivalently, in every finite partially ordered set that is not totally ordered, there exists a pair of elements x and y with the property that at least 1/3 and at most 2/3 of the linear extensions of the partial order place x earlier than y.".
- 3_conjecture thumbnail Aigner_poset.svg?width=300.
- 3_conjecture wikiPageID "28745947".
- 3_conjecture wikiPageRevisionID "597858734".
- 3_conjecture authorlink "Nati Linial".
- 3_conjecture first "Nati".
- 3_conjecture last "Linial".
- 3_conjecture year "1984".
- 3_conjecture subject Category:Conjectures.
- 3_conjecture subject Category:Order_theory.
- 3_conjecture comment "In order theory, a branch of mathematics, the 1/3–2/3 conjecture states that, if one is comparison sorting a set of items then, no matter what comparisons may have already been performed, it is always possible to choose the next comparison in such a way that it will reduce the number of possible sorted orders by a factor of 2/3 or better.".
- 3_conjecture label "1/3–2/3 conjecture".
- 3_conjecture sameAs 3_conjecture.
- 3_conjecture sameAs Q4545863.
- 3_conjecture sameAs Q4545863.
- 3_conjecture wasDerivedFrom 3_conjecture?oldid=597858734.
- 3_conjecture depiction Aigner_poset.svg.