短例外列表的DNF例外问题的下界及相关问题
Lower bounds on the DNF exception problem for short exception lists and related problems
摘要:
本文给出了短例外列表和超立方体覆盖问题的DNF例外问题复杂性的下界。提出的方法是基于松弛的初始问题的某一线性规划问题。当异常列表的大小被维数的对数限制时,提供了一些显式的界限。在这种情况下提供的界限明显强于以前已知的界限。
英文摘要:
In this paper we prowide lower bounds on the complexity of the DNF exception problem for short exception lists and hypercube covering problem. The method proposed is based on the relaxation of the initial problem to a certain linear programming problem. Some explicit bounds are provided for the case when exception list size is bounded above by a logarithm of dimension. The bound provided in this case is significantly stronger than the bounds known before.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。