Related papers: Supercritical Tradeoffs for Monotone Circuits
We prove lower bounds for the Minimum Circuit Size Problem (MCSP) in the Sum-of-Squares (SoS) proof system. Our main result is that for every Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$, SoS requires degree $\Omega(s^{1-\epsilon})$…
The superconducting transition is studied within the one-loop renormalization group in fixed dimension $D=3$ and at the critical point. A tricritical behavior is found, and for $\kappa > \kappa_c$, an attractive charged fixed point,…
The paper discusses the asymptotic depth of a reversible circuit consisting of NOT, CNOT and 2-CNOT gates. Reversible circuit depth function $D(n, q)$ for a circuit implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb Z_2^n$ is…
An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…
In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
We develop a systematic algorithm for constructing an N-fold supersymmetric system from a given vector space invariant under one of the supercharges. Applying this algorithm to spaces of monomials, we construct a new multi-parameter family…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
We study the anomalous dimensions for scalar operators for a three-dimensional Chern-Simons theory recently proposed in arXiv:0806.1218. We show that the mixing matrix at two-loop order is that for an integrable Hamiltonian of an SU(4) spin…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
In this paper, we study the explicit geometry of threefolds, in particular, Fano varieties. We find an explicitly computable positive integer $N$, such that all but a bounded family of Fano threefolds have $N$-complements. This result has…
It is already shown that a Boolean function for a NP-complete problem can be computed by a polynomial-sized circuit if its variables have enough number of automorphisms. Looking at this previous study from the different perspective gives us…
We calculate the gravity one-loop partition function of three-dimensional parity even tricritical gravity. Agreement with logarithmic conformal field theory single-particle partition functions on the field theory side is found and we…
To explore the possibility of self-organized criticality, we look for CFTs without any relevant scalar deformations (a.k.a dead-end CFTs) within power-counting renormalizable quantum field theories with a weakly coupled Lagrangian…
Folklore in complexity theory suspects that circuit lower bounds against $\mathbf{NC}^1$ or $\mathbf{P}/\operatorname{poly}$, currently out of reach, are a necessary step towards proving strong proof complexity lower bounds for systems like…
Smale's alpha-theory certifies that Newton iterations will converge quadratically to a solution of a square system of analytic functions based on the Newton residual and all higher order derivatives at the given point. Shub and Smale…
The paper discusses the gate complexity and the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates in the case, when the number of additional inputs is limited. We study Shannon's gate complexity function $L(n, q)$ and…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
As a natural extension of the SAT problem, an array of proof systems for quantified Boolean formulas (QBF) have been proposed, many of which extend a propositional proof system to handle universal quantification. By formalising the…
Reversible computation is one of the most promising emerging technologies of the future. The usage of reversible circuits in computing devices can lead to a significantly lower power consumption. In this paper we study reversible logic…