By modeling problems as an intersection of matroid constraints, arbitrary combinatorial relationships can be achieved in the task allocation space. To illustrate the expressiveness of the framework, ...

Due to the non-deterministic polynomial-time hardness (NP-hardness) of the joint optimization problem, we translate it into a matroid constrained submodular maximization problem and propose heuristic ...

特定模型中的下界证明: 在诸如拟阵理论（matroid theory）等领域，预言机模型（例如，使用独立性预言机）可以用于证明某些问题的无条件下界，而无需依赖于像 P ≠ NP 这样的未证明的假设6。 密码学中的安全性论证: 在密码学中，“随机预言机模型”（random oracle ...