关于偏导数的复杂性
On the complexity of partial derivatives
摘要:
偏导数法是算术电路最成功的下界方法之一。它使用多项式的偏导数的跨度的维数作为复杂性度量。在本文中,我们认为这种复杂性措施作为一个计算问题:对于一个输入多项式的总和,其非零单项式,什么是复杂的计算空间的偏导数的维数?我们证明这个问题是#P-hard的,并询问它是否属于#P。我们分析了最近在组合学和代数复杂性中用于下界某些矩阵的秩的“踪迹方法”。我们表明,这种方法提供了一个多项式时间的可计算的下限上的维度的跨度偏导数,并从这种方法中,我们得到封闭形式的下限。我们留下了一个开放的问题,存在一个近似算法与合理的性能professions.A略短的版本,这篇文章提出了在STACS'17。在这个新版本中,我们更正了第4.1节中的一个错字,并添加了对Shitov关于张量秩的工作的引用。
英文摘要:
The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider this complexity measure as a computational problem: for an input polynomial given as the sum of its nonzero monomials, what is the complexity of computing the dimension of its space of partial derivatives? We show that this problem is #P-hard and we ask whether it belongs to #P. We analyze the "trace method", recently used in combinatorics and in algebraic complexity to lower bound the rank of certain matrices. We show that this method provides a polynomial-time computable lower bound on the dimension of the span of partial derivatives, and from this method we derive closed-form lower bounds. We leave as an open problem the existence of an approximation algorithm with reasonable performance guarantees.A slightly shorter version of this paper was presented at STACS'17. In this new version we have corrected a typo in Section 4.1, and added a reference to Shitov's work on tensor rank.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。