Branching program size is almost linear in formula size (Q5956012): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoffs for Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal simulations of formulas by bounded-width programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 22:56, 3 June 2024

scientific article; zbMATH DE number 1708332
Language Label Description Also known as
English
Branching program size is almost linear in formula size
scientific article; zbMATH DE number 1708332

    Statements

    Branching program size is almost linear in formula size (English)
    0 references
    0 references
    11 September 2002
    0 references
    0 references
    complexity measures
    0 references
    Boolean functions
    0 references
    0 references