Exponential lower bound for bounded depth circuits with few threshold gates (Q413295): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q413294
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.ipl.2011.12.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982984553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex polynomials and circuit lower bounds for modular counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority gates vs. general weighted threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Lower Bounds for AC 0 with Threshold Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates / rank
 
Normal rank

Latest revision as of 04:19, 5 July 2024

scientific article
Language Label Description Also known as
English
Exponential lower bound for bounded depth circuits with few threshold gates
scientific article

    Statements

    Exponential lower bound for bounded depth circuits with few threshold gates (English)
    0 references
    4 May 2012
    0 references
    0 references
    computational complexity
    0 references
    Boolean circuit complexity
    0 references
    threshold circuits
    0 references
    threshold functions
    0 references
    bounded depth circuits
    0 references
    lower bounds
    0 references
    0 references