Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979569157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear lower bound on the unbounded error probabilistic communication complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of small-depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds on switching energy in VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Close Are We to Understanding V1? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Threshold Circuits with Sparse Activity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
scientific article

    Statements

    Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (English)
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    threshold circuits
    0 references
    neural networks
    0 references
    communication complexity
    0 references
    energy complexity
    0 references
    0 references