Related papers: Computing a Solution of Feigenbaum's Functional Eq…

In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…

We introduce a new notion of computable function on $\R^N$ and prove some basic properties. We give two applications, first a short proof of Yoshinaga's theorem that periods are \el (they are actually low). We also show that the low complex…

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

We consider regularity for solutions of a class of de Rham's functional equations. Under some smoothness conditions of functions consisting the equation, we improve some results in Hata (Japan J. Appl. Math. 1985). Our results are…

Necessary and sufficient conditions are obtained under which the numerator of the partial derivative of a rational function holomorphic in open upper poly-halfplane is the sum of squares of polynomials.

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…

We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…

The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the…

This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…

Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…

We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous…

A numerical method is developed for calculating the real time Green's functions of very large sparse Hamiltonian matrices, which exploits the numerical solution of the inhomogeneous time-dependent Schroedinger equation. The method has a…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We study function-valued solutions of a class of stochastic partial differential equations, involving operators with polynomially bounded coefficients. We consider semilinear equations under suitable parabolicity hypotheses. We provide…

In this paper, we study the convergence of the Euler-Maruyama numerical solutions for pantograph stochastic functional differential equations which was proposed in [11]. We also show that the numerical solutions have the properties of…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

The Feigenbaum-Cvitanovic equation -lambda * g(x)= g(g(lambda * x)) is solved over the interval 0 <= x <= 1 with a Chebyshev series representation of g(x). Accurate expansion coefficients are tabulated for solutions g(x) = 1+O(x^z) with…