On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2021-0031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3207053979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Selection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Constructing Selection Networks with $O(\log n)$ Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on CNF encodings of the at-most-one constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the Boolean circuit complexity of symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinational complexity of certain symmetric Boolean functions / rank
 
Normal rank

Latest revision as of 16:22, 27 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of monotone circuits for threshold symmetric Boolean functions
scientific article

    Statements

    On the complexity of monotone circuits for threshold symmetric Boolean functions (English)
    0 references
    5 January 2022
    0 references
    monotone circuits
    0 references
    complexity
    0 references
    symmetric Boolean functions
    0 references
    threshold functions
    0 references
    0 references

    Identifiers