论文标题
对年轻图的优化
Optimization over Young Diagrams
论文作者
论文摘要
我们考虑找到一个年轻图的问题，将一对函数的评估总和最小化，对相关的共轭分区的各个部分。虽然有很多图表，但我们表明它是可以溶解的多项式时间。
We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is polynomial time solvable.
