Related papers: A Casual Tour Around a Circuit Complexity Bound

We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…

The existence of a countably compact group without non-trivial convergent sequences in ZFC alone is a major open problem in topological group theory. We give a ZFC example of a Boolean topological group G without non-trivial convergent…

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on…

Magnetic molecules are investigated with respect to their usability as units in future quantum devices. In view of quantum computing, a necessary prerequisite is a long coherence time of superpositions of low-lying levels. In this article,…

In this work, we propose a testing procedure to distinguish between the different approaches for computing complexity. Our test does not require a direct comparison between the approaches and thus avoids the issue of choice of gates, basis,…

We prove the convexity of the class of currents with finite relative energy. A key ingredient is an integration by parts formula for relative non-pluripolar products which is of independent interest.

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is…

We construct a family of 1-convex threefolds, with exceptional curve C of type (0,-2), which are not embeddable in C^m \times CP_n. In order to show that they are not Kaehler we exhibit a real 3-dimensional chain A whose boundary is the…

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

We study symmetric arithmetic circuits and improve on lower bounds given by Dawar and Wilsenach (ArXiv 2020). Their result showed an exponential lower bound of the permanent computed by symmetric circuits. We extend this result to show a…

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We study the average-case hardness of establishing that a graph does not have a large clique in both proof and communication complexity. We show exponential lower bounds on the length of cutting planes and bounded-depth resolution over…

In a recent Letter, Bennett and coworkers [1] argue that proofs of exotic quantum effects using closed timelike curves (CTC's) based on the work of Deutsch [2], or other nonlinear quantum dynamics, suffer from a fallacy that they call the…

Recently many simple principles have been proposed that can explain quantum limitations on possible sets of experimental probabilities in nonlocality and contextuality experiments. However, few implications between these principles are…