On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On polynomial complexity of a stochastic algorithm for mixed zero-one programs. |
scientific article; zbMATH DE number 2032811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomial complexity of a stochastic algorithm for mixed zero-one programs. |
scientific article; zbMATH DE number 2032811 |
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
0.7302607297897339
0 references
0.7278463840484619
0 references
0.7262416481971741
0 references
0.7262415885925293
0 references
