On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4097679 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5842591 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5624436 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5647750 / 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: The multivariate normal distribution / rank | |||
Normal rank |
Latest revision as of 14:18, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On polynomial complexity of a stochastic algorithm for mixed zero-one programs. |
scientific article |
Statements
On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (English)
0 references
26 January 2004
0 references
Mixed zero-one program
0 references
Randomization method
0 references
Polynomial time
0 references
Probabilistic analysis
0 references
Central limit theorem
0 references