Approximation of boolean functions by combinatorial rectangles (Q1399979): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization and nondeterminism are comparable for ordered read-once branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinism versus non-determinism for linear time RAMs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative arithmetic circuits: depth reduction and size lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Nondeterminism Unambiguous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Random Sources, Hitting Sets, and BPP Simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs / 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: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Modes of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on read-$k$ times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the probabilistic algorithms and NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of branching programs and decision trees for clique functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347300 / rank
 
Normal rank

Latest revision as of 18:55, 5 June 2024

scientific article
Language Label Description Also known as
English
Approximation of boolean functions by combinatorial rectangles
scientific article

    Statements

    Approximation of boolean functions by combinatorial rectangles (English)
    0 references
    0 references
    30 July 2003
    0 references
    0 references
    branching programs
    0 references
    communication complexity
    0 references
    lower bounds
    0 references
    approximation
    0 references
    nondeterminism
    0 references
    randomness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references