On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:43, 31 January 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
