How Do Read-Once Formulae Shrink? (Q4325332): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60299186 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short monotone formulae for the majority function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinkage of de Morgan formulae under restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of random restrictions on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 12:15, 23 May 2024

scientific article; zbMATH DE number 731955
Language Label Description Also known as
English
How Do Read-Once Formulae Shrink?
scientific article; zbMATH DE number 731955

    Statements

    How Do Read-Once Formulae Shrink? (English)
    0 references
    0 references
    0 references
    2 July 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bounds
    0 references
    complexity of Boolean functions
    0 references
    random restrictions
    0 references
    expected formula size
    0 references
    expected number of variables
    0 references
    read-once function
    0 references
    0 references