arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1710.03702cs.CCcs.LO
收藏

可行逼近函数的表示与求值策略

Representations and evaluation strategies for feasibly approximable functions

Michal Konečný, Eike Neumann

摘要:

Ko和Friedman(1982)的一个著名结果断言,一元实函数的积分和最大化问题在定义明确的意义上是计算困难的。然而,在实践中,这两个泛函都是以很高的速度进行常规计算的。我们的目标是解决这一明显的悖论,通过研究类的功能,可以可行的整合和最大化,连同这些类的功能编码的信息,这是必要的统一计算积分和最大值在多项式时间表示。其理论框架是Kawamura和Cook(2012)提出的分析中算子的二阶复杂性理论。我们研究的表示是基于严格逼近多项式,分段多项式,有理函数。我们比较了这些表示的多时间可归约性以及它们快速评估给定语言中符号表达式的能力。我们表明,表示严格逼近的分段多项式的基础上是多时间等价的表示严格逼近的有理函数的基础上。有了这种表示,在某种语言中的所有条款,这是表达足以包含最大值和积分的大多数函数的实际利益,可以在多项式时间评估。相比之下,基于多项式近似的表示和基于函数求值的标准表示(隐含在Ko-Friedman结果的基础上)都需要指数时间来计算这种语言中的某些项。我们证实了我们的理论结果,在Haskell中的实现,这提供了一些证据,二阶多项式时间的可计算性同样密切相关的实际可行性,其一阶对应。

英文摘要:

A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great speed in practice. We aim to resolve this apparent paradox by studying classes of functions which can be feasibly integrated and maximised, together with representations for these classes of functions which encode the information which is necessary to uniformly compute integral and maximum in polynomial time. The theoretical framework for this is the second-order complexity theory for operators in analysis which was introduced by Kawamura and Cook (2012). The representations we study are based on rigorous approximation by polynomials, piecewise polynomials, and rational functions. We compare these representations with respect to polytime reducibility as well as with respect to their ability to quickly evaluate symbolic expressions in a given language. We show that the representation based on rigorous approximation by piecewise polynomials is polytime equivalent to the representation based on rigorous approximation by rational functions. With this representation, all terms in a certain language, which is expressive enough to contain the maximum and integral of most functions of practical interest, can be evaluated in polynomial time. By contrast, both the representation based on polynomial approximation and the standard representation based on function evaluation, which implicitly underlies the Ko-Friedman result, require exponential time to evaluate certain terms in this language. We confirm our theoretical results by an implementation in Haskell, which provides some evidence that second-order polynomial time computability is similarly closely tied with practical feasibility as its first-order counterpart.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑