Sign-representation of Boolean functions using a small number of monomials
From MaRDI portal
Recommendations
- Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions
- New degree bounds for polynomial threshold functions
- Representation of Boolean functions by polynomial forms
- scientific article; zbMATH DE number 5852793
- Computational bound on complexity of polynomial representations of Boolean functions
Cites work
- A theory of the learnable
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}n
- Deductive learning
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 446494 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 761425 (Why is no real title available?)
- On PAC learning algorithms for rich Boolean function classes
- On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
- On the complexity of computing and learning with multiplicative neural networks
- Spectral properties of threshold functions
- The expressive power of voting polynomials
- Vector analysis of threshold functions
Cited in
(3)- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
- The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
- Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions
This page was built for publication: Sign-representation of Boolean functions using a small number of monomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280399)
