Related papers: Computational Complexity of Functions
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…
The study of the operational complexity of minimal pumping constants started in [J. DASSOW and I. JECKER. Operational complexity and pumping lemmas. Acta Inform., 59:337-355, 2022], where an almost complete picture of the operational…
In 1938, Morse and Hedlund proved that the subword complexity function of an infinite word is either bounded or at least linearly growing. In 1982, Ehrenfeucht and Rozenberg proved that this gap property holds for the subword complexity…
We prove that operators satisfying the hypotheses of the extrapolation theorem for Muckenhoupt weights are bounded on weighted Morrey spaces. As a consequence, we obtain at once a number of results that have been proved individually for…
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We prove that convex functions on a $C_b(X)$ space satisfying a mild continuity condition can be represented using sigma additive measures. This generalises a result of Cheridito, Kupper and Tangpi,
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…
We improve our previous results on indefinite Kasparov modules, which provide a generalisation of unbounded Kasparov modules modelling non-symmetric and non-elliptic (e.g. hyperbolic) operators. In particular, we can weaken the assumptions…
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…
It is well known that sparse approximation problem is \textsf{NP}-hard under general dictionaries. Several algorithms have been devised and analyzed in the past decade under various assumptions on the \emph{coherence} $\mu$ of the…
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
It is known that the set of all solutions of a commutant lifting and other interpolation problems admits a Redheffer linear-fractional parametrization. The method of unitary coupling identifies solutions of the lifting problem with minimal…
This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it is shown to generalise three previous lower bounds results…
In this paper we prove the probabilistic continuous complexity conjecture. In continuous complexity theory, this states that the complexity of solving a continuous problem with probability approaching 1 converges (in this limit) to the…
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way. An explanation here is a sequence of simple inference steps where simplicity is quantified…
We make progress on a problem of R. Coifman, P.-L. Lions, Y. Meyer, and S. Semmes from 1993 by showing that the Jacobian operator $J$ does not map $W^{1,n}(\mathbb R^n,\mathbb R^n)$ onto the Hardy space $\mathcal{H}^1(\mathbb R^n)$ for any…