Skip to main content
MathOverflow

Return to Answer

some LaTeX
Source Link
edit approved Jul 25, 2021 at 23:55
Dirk Werner
edit approved Jul 25, 2021 at 23:55
Dirk Werner
  • 1.8k
  • 1
  • 10
  • 17

If you have an algorithm "from big to small", couldn't you obtain an algorithm "from small to big" by replacing the vectors a$a$, and b$b$ by x1-a and x1-b$x*1-a$ and $x*1-b$ respectively, where 1$1$ is the vector containing just ones and x$x$ is a scalar, larger than the maximum of and$a$ and b$b$?

If you have an algorithm "from big to small", couldn't you obtain an algorithm "from small to big" by replacing the vectors a, and b by x1-a and x1-b respectively, where 1 is the vector containing just ones and x is a scalar, larger than the maximum of and and b?

If you have an algorithm "from big to small", couldn't you obtain an algorithm "from small to big" by replacing the vectors $a$, and $b$ by $x*1-a$ and $x*1-b$ respectively, where $1$ is the vector containing just ones and $x$ is a scalar, larger than the maximum of $a$ and $b$?

Source Link
BeB
BeB
  • 1

If you have an algorithm "from big to small", couldn't you obtain an algorithm "from small to big" by replacing the vectors a, and b by x1-a and x1-b respectively, where 1 is the vector containing just ones and x is a scalar, larger than the maximum of and and b?