Talk:Fourier–Motzkin elimination
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||||||
|
![]() | This article contains a translation of Élimination de Fourier-Motzkin from fr.wikipedia. |
Untitled
[edit]why on earth are variable denoted with \xi ? What's wrong with regular old "x"? The overuse of Greek symbols does nothing but put people off
Ghaa!! Shun all who want to cheapen mathematics by making it easier to learn!! LoL
"Double-exponential computational complexity" isn't too clear. How about an explanation in Big-Oh notation? — Preceding unsigned comment added by 91.152.246.210 (talk) 19:57, 12 May 2012 (UTC)
Appears not to be correct
[edit]"Define the history of an inequality as the set of indexes of inequalities from the initial system used to produce .
[...]
A variable is in the set as soon as at least one inequality in the history of results from the elimination of ."
AFAICT, the underlined part cannot be correct. NO inequalities in result from any elimination, since these are the starting set. I suppose it should instead say something like "... the elimination of is involved anywhere in the process of creating "? 2A00:23C8:7B09:FA01:40CB:9260:295F:C18E (talk) 21:21, 27 August 2023 (UTC)
- Articles with conflicting quality ratings
- Stub-Class mathematics articles
- Low-priority mathematics articles
- Start-Class Systems articles
- Unknown-importance Systems articles
- Unassessed field Systems articles
- WikiProject Systems articles
- Start-Class Computer science articles
- Unknown-importance Computer science articles
- WikiProject Computer science articles
- Pages translated from French Wikipedia