Efficient oblivious branching programs for threshold and mod functions (Q1384527): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Meanders and their applications in lower bounds arguments / rank
 
Normal rank
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: Lower bounds to the complexity of symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear lower bounds for bounded-width branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Simulations of Balanced Formulae by Branching Programs / 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: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 12:09, 28 May 2024

scientific article
Language Label Description Also known as
English
Efficient oblivious branching programs for threshold and mod functions
scientific article

    Statements

    Efficient oblivious branching programs for threshold and mod functions (English)
    0 references
    0 references
    0 references
    4 August 1998
    0 references
    0 references
    branching programs
    0 references
    0 references