Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for (MOD<i><sub>p</sub></i> - MOD<i><sub>m</sub></i>) Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size--Depth Tradeoffs for 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: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational approximation techniques for analysis of neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Threshold Circuits with Sparse Activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy and depth of threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and Energy of Threshold Circuits Computing Mod Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the parity function in unbounded fan-in, unbounded depth circuits / rank
 
Normal rank

Latest revision as of 19:45, 3 July 2024

scientific article
Language Label Description Also known as
English
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
scientific article

    Statements

    Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2011
    0 references
    0 references
    energy complexity
    0 references
    parity function
    0 references
    size-energy tradeoff
    0 references
    symmetric Boolean functions
    0 references
    threshold circuits
    0 references
    unate circuits
    0 references
    0 references