Related papers: Supercritical Tradeoffs for Monotone Circuits
An effective quantum field theory description of graphene in the ultra-relativistic regime is given by reduced QED aka. pseudo QED aka. mixed-dimensional QED. It has been speculated in the literature that reduced QED constitutes an example…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
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…
Three-dimensional quantum electrodynamics with $N$ charged fermions contains monopole operators that have been studied perturbatively at large $N$. Here, we initiate the study of these monopole operators in the $4-\epsilon$ expansion by…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters. Determining the…
In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…
We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…
We remark on pseudo-elliptic integrals and on exceptional function fields, namely function fields defined over an infinite base field but nonetheless containing non-trivial units. Our emphasis is on some elementary criteria that must be…
A two-dimensional CFT dual to a semiclassical theory of gravity in three dimensions must have a large central charge $c$ and a sparse low energy spectrum. This constrains the OPE coefficients and density of states of the CFT via the…
In this paper, using the monotone iterative technique and the Banach contraction mapping principle, we study a class of fractional differential system with integral boundary on an infinite interval. Some explicit monotone iterative schemes…
Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…
We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…
Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…
We design polynomial size, constant depth (namely, $\mathsf{AC}^0$) arithmetic formulae for the greatest common divisor (GCD) of two polynomials, as well as the related problems of the discriminant, resultant, B\'ezout coefficients,…
We give an axiomatization of the class ECF of exponentially closed fields, which includes the pseudo-exponential fields previously introduced by the second author, and show that it is superstable over its interpretation of arithmetic.…
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…
We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function $\rho$, unless $FPT\neq W[1]$. In particular, not having such…
A monotone Boolean (OR,AND) circuit computing a monotone Boolean function f is a read-k circuit if the polynomial produced (purely syntactically) by the arithmetic (+,x) version of the circuit has the property that for every prime implicant…
In this paper, we investigate computational power of threshold circuits and other theoretical models of neural networks in terms of the following four complexity measures: size (the number of gates), depth, weight and energy. Here the…