Approximation of some NP-hard optimization problems by finite machines, in probability (Q5941283): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a bin covering algorithm / 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: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank

Revision as of 19:23, 3 June 2024

scientific article; zbMATH DE number 1635448
Language Label Description Also known as
English
Approximation of some NP-hard optimization problems by finite machines, in probability
scientific article; zbMATH DE number 1635448

    Statements

    Approximation of some NP-hard optimization problems by finite machines, in probability (English)
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    NP-optimization problems
    0 references
    approximation
    0 references
    probabilistic analysis of algorithms
    0 references
    finite-state machines
    0 references

    Identifiers