Improved parallel approximation of a class of integer programming problems (Q676274): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optima of dual integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions / 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: Improved algorithms via approximations of probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms and pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / 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 parallel approximation algorithm for positive linear programming / 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: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875163 / rank
 
Normal rank

Latest revision as of 11:51, 27 May 2024

scientific article
Language Label Description Also known as
English
Improved parallel approximation of a class of integer programming problems
scientific article

    Statements

    Improved parallel approximation of a class of integer programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 1997
    0 references
    0 references
    derandomization
    0 references
    VLSI gate arrays
    0 references
    NC approximation algorithms
    0 references
    0 references
    0 references