On the computation of Boolean functions by analog circuits of bounded fan-in
From MaRDI portal
Publication:676434
DOI10.1006/JCSS.1997.1480zbMATH Open0869.68050OpenAlexW2022721156MaRDI QIDQ676434FDOQ676434
Authors: Gy. Turán, Farrokh Vatan 
Publication date: 18 March 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1480
Recommendations
Cites Work
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Betti Numbers of Real Varieties
- Approximation by superpositions of a sigmoidal function
- Title not available (Why is that?)
- Lower Bounds for Approximation by Nonlinear Manifolds
- Feedforward nets for interpolation and classification
- Computing over the reals with addition and order
- Title not available (Why is that?)
- On the computational power of neural nets
- Threshold circuits of bounded depth
- Title not available (Why is that?)
- On representation of functions by means of superpositions and related topics
- Title not available (Why is that?)
- Analog computation via neural networks
- 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
- Separation of complexity classes in Koiran's weak model
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- On the Complexity of Quantifier Elimination: the Structural Approach
- Lower bounds for arithmetic networks
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- Two \(P\)-complete problems in the theory of the reals
- Title not available (Why is that?)
- Title not available (Why is that?)
- A size-depth trade-off for the analog computation of Boolean functions
- On the complexity of encoding in analog circuits
- On the positive and the inversion complexity of Boolean functions
- Title not available (Why is that?)
- Lower bounds on threshold and related circuits via communication complexity
- Neural Nets with Superlinear VC-Dimension
- Title not available (Why is that?)
- On the Power of Real Turing Machines over Binary Inputs
- Title not available (Why is that?)
- Finiteness results for sigmoidal “neural” networks
- Bounds for the computational power and learning complexity of analog neural nets
Cited In (6)
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
- On the complexity of encoding in analog circuits
- Complexity of approximation of Lipschitz functions
- Unsolvability of some problems about piecewise-polynomial functions
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
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)
