Related papers: Exponential-Size Circuit Complexity is Comeager in…
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…
Recently it has been advocated [1] that for describing nature within the minimal symmetry requirement, certain subgroups of Lorentz group may play a fundamental role. One such group is E(2) which induces a Lie algebraic Non-Commutative…
This paper deals with different concepts for characterizing the size of mathematical objects. A game theoretic investigation and generalization of two size concepts, which can both be formulated in topological terms, is provided: the so…
We prove lower bounds for the randomized approximation of the embedding $\ell_1^m \rightarrow \ell_\infty^m$ based on algorithms that use arbitrary linear (hence non-adaptive) information provided by a (randomized) measurement matrix $N \in…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
A meandric system of size $n$ is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on $\{1,\dots,2n\}$, one drawn above the real line and the other below the real line. A uniform random meandric system can be…
We study the possibility of designing $N^{o(1)}$-round protocols for problems of substantially super-linear polynomial-time (sequential) complexity in the model of Massively Parallel Computation, where $N$ is the input size. We show that if…
We investigate how the addition of quantum resources changes the statistical complexity of quantum circuits by utilizing the framework of quantum resource theories. Measures of statistical complexity that we consider include the Rademacher…
Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…
In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties.…
We study the randomized version of a computation model (introduced by Grohe, Koch, and Schweikardt (ICALP'05); Grohe and Schweikardt (PODS'05)) that restricts random access to external memory and internal memory space. Essentially, this…
In this paper, we introduce the second-order Esscher pricing notion for continuous-time models. Depending whether the stock price $S$ or its logarithm is the main driving noise/shock in the Esscher definition, we obtained two classes of…
Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel…
In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher complexity, to the…
We give a simplified and improved lower bound for the simplex range reporting problem. We show that given a set $P$ of $n$ points in $\mathbb{R}^d$, any data structure that uses $S(n)$ space to answer such queries must have…
Charges associated with gauge symmetries are defined on boundaries of spacetimes. But these constructions typically involve divergent quantities when considering asymptotic boundaries. Different prescriptions exist to address this problem,…
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per…
We prove that for $n\geq2$ there exists a compact subset $X$ of the closed ball in $R^{2n}$ of radius $\sqrt{2}$, such that $X$ has Hausdorff dimension $n$ and does not symplectically embed into the standard open symplectic cylinder. The…
We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long-term behavior. It is shown that a very general class of decision problems regarding…
We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…