Related papers: On computational complexity of Siegel Julia sets
There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field. We define a subclass of deterministic…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
During early 1980s, the so-called `escape time' method, developed to display the Julia sets for complex dynamical systems, was exported to quaternions in order to draw analogous pictures in this wider numerical field. Despite of the fine…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations of Jones polynomials can be used to bound the classical…
We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We investigate the Ulrich complexity of certain examples of Brauer--Severi varieties, twisted flags and involution varieties and establish lower and upper bounds. Furthermore, we relate Ulrich complexity to the categorical representability…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…
It is not commonly realized that the algebra of complex numbers can be used in an elegant way to represent the images of ordinary 3-dimensional figures, orthographically projected to the plane. We describe these ideas here, both using…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…