Can submodularity be tested with polynomially many queries?
Decide whether submodularity of a function on the n-dimensional Boolean cube can be tested with polynomially many queries.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。
Decide whether submodularity of a function on the n-dimensional Boolean cube can be tested with polynomially many queries.
PR 把工作从一条路线带到另一条;合并它就是采纳。
PR 把工作从一个分支带到另一个分支。