More on the complexity of slice functions (Q1079365): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation is Powerless for Boolean Slice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of slice functions / rank
 
Normal rank

Latest revision as of 15:16, 17 June 2024

scientific article
Language Label Description Also known as
English
More on the complexity of slice functions
scientific article

    Statements

    More on the complexity of slice functions (English)
    0 references
    0 references
    1986
    0 references
    0 references
    circuit complexity
    0 references
    Boolean function
    0 references
    monotone complexity
    0 references
    0 references