Computing Boolean functions by polynomials and threshold circuits
From MaRDI portal
Publication:1293360
DOI10.1007/s000370050015zbMath0936.94022OpenAlexW2091623775MaRDI QIDQ1293360
Publication date: 17 April 2000
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000370050015
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
A characterization of 2-threshold functions via pairs of prime segments ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ The Power of Asymmetry in Constant-Depth Circuits ⋮ A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length ⋮ A Short List of Equalities Induces Large Sign-Rank ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic Polynomials ⋮ New degree bounds for polynomial threshold functions ⋮ The hardest halfspace ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ Optimal bounds for sign-representing the intersection of two halfspaces by polynomials ⋮ Degree-uniform lower bound on the weights of polynomials with given sign function ⋮ Polynomial threshold functions and Boolean threshold circuits ⋮ Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ ⋮ Asymptotics of the number of 2-threshold functions ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
This page was built for publication: Computing Boolean functions by polynomials and threshold circuits
