Related papers: A Casual Tour Around a Circuit Complexity Bound
This paper studies infinite acyclic complexes of finitely generated free modules over a commutative noetherian local ring $(R,m)$ with $m^3=0$. Conclusive results are obtained on the growth of the ranks of the modules in acyclic complexes,…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…
The purpose of this note is to give a new, short proof of a classification of ACM sets of points in $P^1XP^1$ in terms of separators.
The complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random…
Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be…
This note closes a minor gap in the literature on the counting complexity of conjunctive queries by showing that queries that are not free-connex do not have a linear time counting algorithm under standard complexity assumptions. More…
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…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
We prove several results giving new and stronger connections between learning, circuit lower bounds and pseudorandomness. Among other results, we show a generic learning speedup lemma, equivalences between various learning models in the…
Lutz (1987) introduced resource-bounded category and showed the circuit size class SIZE($\frac{2^n}{n}$) is meager within ESPACE. Li (2024) established that the symmetric alternation class $S^E_2$ contains problems requiring circuits of…
The nonexponential relaxation ocurring in complex dynamics manifested in a wide variety of systems is analyzed through a simple model of diffusion in phase space. It is found that the inability of the system to find its equilibrium state in…
We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative weights in a given time series. Two different tools have been advanced in the literature to such effect, namely, i) the…
We show that if P$\neq$NP, then a wide class of TSP heuristics fail to approximate the length of the TSP to asymptotic optimality, even for random Euclidean instances. Previously, this result was not even known for any heuristics (greedy,…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
The boundedness tests for the number of compact integral manifolds of autonomous ordinary differential systems, of autonomous total differential systems, of linear systems of partial differential equations, of Pfaff systems of equations,…
Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…
Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…
Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…
Near-term feasibility, classical hardness, and verifiability are the three requirements for demonstrating quantum advantage; most existing quantum advantage proposals achieve at most two. A promising candidate recently proposed is through…