Deterministic parallel algorithms for bilinear objective functions (Q666681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Fourth Moment Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of ±1 matrices under line shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms via approximations of probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Derandomization Scheme and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing randomness in parallel computation without a processor penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic method yields deterministic parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{RL}\subseteq \text{SC}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic derandomization via complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank

Revision as of 16:26, 18 July 2024

scientific article
Language Label Description Also known as
English
Deterministic parallel algorithms for bilinear objective functions
scientific article

    Statements

    Deterministic parallel algorithms for bilinear objective functions (English)
    0 references
    0 references
    0 references
    11 March 2019
    0 references
    derandomization
    0 references
    bilinear objective
    0 references
    maximal independent set
    0 references
    fooling automata
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references