搜索结果: 1-1 共查到“数学 Realizability of Polytopes”相关记录1条 . 查询时间(0.078 秒)
Realizability of Polytopes as a Low Rank Matrix Completion Problem
Realizability of Polytopes Low Rank Matrix Completion Problem
font style='font-size:12px;'>
2011/2/22
Here we show that the problem of realizing a polytope with specified combinatorics is equivalent to a low rank matrix completion problem.This is comparable to known results reducing realizability to s...