Related papers: Complexity and Avoidance
It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper…
Series expansions in the chemical potential mu are studied for an effective theory of QCD which has a flux representation where the complex action is overcome. In particular we consider fugacity series, Taylor expansion and a modified…
Within the framework of generalized combinatorial approach, complexity is determined as a disorder measure for hierarchical statistical ensembles related to Cayley trees possessing arbitrary branching and number of levels. With…
Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…
In a recent paper, Bona and Smith define the notion of \textit{strong avoidance}, in which a permutation and its square both avoid a given pattern. In this paper, we generalize this idea to what we call \textit{chain avoidance}. We say that…
Global inequality has shifted inward, with rising dispersion increasingly occurring within countries rather than between them. Using 8,790 newly harmonised Functional Urban Areas (FUAs), micro-founded labour-market regions encompassing 3.9…
We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…
Using a diagrammatic approach to Eulerian perturbation theory, we analytically calculate the variance and skewness of the density and velocity divergence induced by gravitational evolution from Gaussian initial conditions, including…
We study and characterize the inclusion relations of global classes in the general weight matrix framework in terms of growth relations for the defining weight matrices. We consider the Roumieu and Beurling cases, and as a particular case…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
Quality-Diversity (QD) algorithms are a new type of Evolutionary Algorithms (EAs), aiming to find a set of high-performing, yet diverse solutions. They have found many successful applications in reinforcement learning and robotics, helping…
We consider processing networks where multiple dispatchers are connected to single-server queues by a bipartite compatibility graph, modeling constraints that are common in data centers and cloud networks due to geographic reasons or data…
Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n \times n$ square matrices combining ``\emph{Strassen-like}'' fast matrix multiplication approach with…
Open-ended evolution requires unbounded possibilities that evolving entities can explore. The cardinality of a set of those possibilities thus has a significant implication for the open-endedness of evolution. We propose that facilitating…
Fluctuation scaling is observed phenomenon from complex networks through finance to ecology. It means that the variance and the mean of a specific quantity are related as $\ev{\sigma^2|n}\propto \ev{n|A}^{2\alpha}$ with $1/2\geq \alpha \geq…
In this work, we consider the approximation of a large class of bounded functions, with minimal regularity assumptions, by ReLU neural networks. We show that the approximation error can be bounded from above by a quantity proportional to…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
We propose a tractable unified framework to study the evolution and interaction of model-misspecification concerns and complexity aversion in repeated decision problems. This aims to capture environments where decision makers worry that…