On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Quantifier Elimination: the Structural Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Real Turing Machines over Binary Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of complexity classes in Koiran's weak model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two \(P\)-complete problems in the theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the positive and the inversion complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing over the reals with addition and order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the computational power and learning complexity of analog neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Nets with Superlinear VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness results for sigmoidal “neural” networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on threshold and related circuits via communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computation via neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedforward nets for interpolation and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A size-depth trade-off for the analog computation of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representation of functions by means of superpositions and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Approximation by Nonlinear Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of encoding in analog circuits / rank
 
Normal rank

Revision as of 10:52, 27 May 2024

scientific article
Language Label Description Also known as
English
On the computation of Boolean functions by analog circuits of bounded fan-in
scientific article

    Statements

    On the computation of Boolean functions by analog circuits of bounded fan-in (English)
    0 references
    0 references
    0 references
    18 March 1997
    0 references
    Boolean circuits
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers