Related papers: Complexity of short generating functions
Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…
Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
The main purpose of this paper is to derive a new perturbation theory (PT) that has converging series. Such series arise in the nonlocal scalar quantum field theory (QFT) with fractional power potential. We construct PT for the generating…
We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by…
In this paper, we give a simple criterion to verify that functions of the form $e^g$ are in the Hayman class when $g$ is a power series with nonnegative coefficients. Thus, using the Hayman and B\'aez-Duarte formulas, we obtain asymptotics…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
For several classical nonnegative integer functions, we investigate if they are members of the counting complexity class #P or not. We prove #P membership in surprising cases, and in other cases we prove non-membership, relying on standard…
We describe all Gaussian generating functionals on several easy quantum groups given by non-crossing partitions. This includes in particular the free unitary, orthogonal and symplectic quantum groups. We further characterize central…