Polynomial size \(\Omega\)-branching programs and their computational power (Q918199): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3686041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of parallel computers from various basis of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity theory based on Boolean algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 10:13, 21 June 2024

scientific article
Language Label Description Also known as
English
Polynomial size \(\Omega\)-branching programs and their computational power
scientific article

    Statements

    Polynomial size \(\Omega\)-branching programs and their computational power (English)
    0 references
    0 references
    1990
    0 references
    0 references
    separation
    0 references
    branching programs
    0 references