Related papers: About set-theoretic properties of one-way function…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

We describe an algorithm that for every given braid $B$ explicitly constructs a function $f:\mathbb{C}^{2}\rightarrow\mathbb{C}$ such that $f$ is a polynomial in $u$, $v$ and $\overline{v}$ and the zero level set of $f$ on the unit…

For each n,N>0 we construct a set of points x_1,...,x_M in D^n with the following property: if f is a rational inner function on D^n of degree strictly less than N and g is an analytic function mapping D^n to D that satisfies g(x_i)=f(x_i)…

In this note we consider a collection C of one parameter families of unimodal maps of [0,1]. Each family in the collection has the form uf where u is in [0,1]. Denoting the kneading sequence of uf by K(uf), we will prove that for each…

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

The unit selection problem is to identify a group of individuals who are most likely to exhibit a desired mode of behavior, for example, selecting individuals who would respond one way if incentivized and a different way if not. The unit…

One-way functions are used in modern cryto-systems as doortraps because their inverse functions are supposed to be difficult to compute. Nonetheless with the discovery of reversible computation, it seems that one may break a one-way…

The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…

We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

In this paper we consider class of continuous functions, called quasiaharmonic functions, admitting best approximations by harmonic polynomials. In this class we prove a uniqueness theorem by analogy with the analytic functions.

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

In this article we consider functions $f$ meromorphic in the unit disk. We give an elementary proof for a condition that is sufficient for the univalence of such functions. This condition simplifies and generalizes known conditions. We…

Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.…

This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…

We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the W-hierarchy (i.e., W[P] = FPT). The collapsing results are also extended to assumed exponential kernels for…

We produce two separate algebraic descriptions of the isomorphism classes of the solvable subgroups of the group PLo(I) of piecewise-linear orientation-preserving homeomorphisms of the unit interval under the operation of composition, and…

This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…

In this work we consider one-dimensional generalized affine processes under the paradigm of Knightian uncertainty (so-called non-linear generalized affine models). This extends and generalizes previous results in Fadina et al. (2019) and…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…