相关论文: Complexity of short generating functions

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

The representation zeta function of a profinite group $G$ encodes the distribution of continuous irreducible complex representations of $G$ as a function of the dimension. Its abscissa of convergence $\alpha(G)$ describes the polynomial…

In this paper, we analyze the complexity of functional programs written in the interaction-net computation model, an asynchronous, parallel and confluent model that generalizes linear-logic proof nets. Employing user-defined sized and…

We construct a class of finite rank multiplicative subgroups of the complex numbers such that the expansion of the real field by such a group is model-theoretically well-behaved. As an application we show that a classification of expansions…

We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclicity, where $\mathcal F$ is the family of subsets of the natural numbers containing arbitrarily long arithmetic progressions. We prove several…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Instead of dealing with cumbersome binomial identities, we prove Callan's result using generating functions.

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

Can deep neural networks learn to solve any task, and in particular problems of high complexity? This question attracts a lot of interest, with recent works tackling computationally hard tasks such as the traveling salesman problem and…

We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

In this paper, we consider situations in which a given logical function is realized by a multithreshold threshold function. In such situations, constant functions can be easily obtained from multithreshold threshold functions, and…

We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those…

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…