On the computation of Boolean functions by analog circuits of bounded fan-in
From MaRDI portal
(Redirected from Publication:676434)
Recommendations
Cites work
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- A size-depth trade-off for the analog computation of Boolean functions
- Analog computation via neural networks
- Approximation by superpositions of a sigmoidal function
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Bounds for the computational power and learning complexity of analog neural nets
- Computing over the reals with addition and order
- Feedforward nets for interpolation and classification
- Finiteness results for sigmoidal “neural” networks
- scientific article; zbMATH DE number 446494 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4028448 (Why is no real title available?)
- scientific article; zbMATH DE number 3758255 (Why is no real title available?)
- scientific article; zbMATH DE number 1263195 (Why is no real title available?)
- scientific article; zbMATH DE number 1263209 (Why is no real title available?)
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 727424 (Why is no real title available?)
- scientific article; zbMATH DE number 1142303 (Why is no real title available?)
- scientific article; zbMATH DE number 1995129 (Why is no real title available?)
- scientific article; zbMATH DE number 774000 (Why is no real title available?)
- Lower Bounds for Approximation by Nonlinear Manifolds
- Lower bounds for arithmetic networks
- Lower bounds on threshold and related circuits via communication complexity
- Neural Nets with Superlinear VC-Dimension
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On representation of functions by means of superpositions and related topics
- On the Betti Numbers of Real Varieties
- On the complexity of encoding in analog circuits
- On the Complexity of Quantifier Elimination: the Structural Approach
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational power of neural nets
- On the positive and the inversion complexity of Boolean functions
- On the Power of Real Turing Machines over Binary Inputs
- Separation of complexity classes in Koiran's weak model
- Threshold circuits of bounded depth
- Two \(P\)-complete problems in the theory of the reals
Cited in
(7)- On the complexity of encoding in analog circuits
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
- Complexity of approximation of Lipschitz functions
- Efficient digital-to-analog encoding
- Unsolvability of some problems about piecewise-polynomial functions
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
This page was built for publication: On the computation of Boolean functions by analog circuits of bounded fan-in
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676434)
