Related papers: About set-theoretic properties of one-way function…
In classical function theory, a function is holomorphic if and only if it is complex analytic. For higher dimensional spaces it is natural to work in the context of Clifford algebras. The structures of these algebras depend on the parity of…
In various applications the problem of separation of the original signal and the noise arises. For example, in the identification problem for discrete linear and causal systems, the original signal consists of the values of transfer…
A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1-in-kSAT with no restrictions on the number of literals per clause can be decided in…
What makes a computational problem easy (e.g., in P, that is, solvable in polynomial time) or hard (e.g., NP-hard)? This fundamental question now has a satisfactory answer for a quite broad class of computational problems, so called…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
The class of differential-equation eigenvalue problems $-y''(x)+x^{2N+2}y(x)=x^N Ey(x)$ ($N=-1,0,1,2,3,...$) on the interval $-\infty<x<\infty$ can be solved in closed form for all the eigenvalues $E$ and the corresponding eigenfunctions…
Inspired by real-world applications such as the assignment of pupils to schools or the allocation of social housing, the one-sided matching problem studies how a set of agents can be assigned to a set of objects when the agents have…
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…
This preliminary report addresses the expressive power of unit resolution regarding input data encoded with partial truth assignments of propositional variables. A characterization of the functions that are computable in this way, which we…
In this paper, we define a subclass of sense-preserving harmonic functions associated with a class of analytic functions satisfying a differential inequality. We then establish a close relation between both subclasses. Further, we obtain…
We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…
In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…
The study of semifeasible algorithms was initiated by Selman's work a quarter of century ago [Sel79,Sel81,Sel82]. Informally put, this research stream studies the power of those sets L for which there is a deterministic (or in some cases,…
A function $\mathfrak{F}$ with simple and nice algebraic properties is defined on a subset of the space of complex sequences. Some special functions are expressible in terms of $\mathfrak{F}$, first of all the Bessel functions of first…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…
The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular spanning subgraphs $F_1,\ldots, F_k$, called factors. The classic Oberwolfach problem corresponds to the case when all of the factors are…
Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…