On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6763513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On probabilistic algorithm for solving almost all instances of the set partition problem |
scientific article; zbMATH DE number 6763513 |
Statements
On probabilistic algorithm for solving almost all instances of the set partition problem (English)
0 references
22 August 2017
0 references
set partition
0 references
cubic hypersurfaces
0 references
smoothness
0 references
tangent line
0 references
polynomial
0 references
discriminant
0 references
computational complexity
0 references
0 references
0 references
0.7032533288002014
0 references
0.7005031704902649
0 references
0.6824882626533508
0 references
0.6824162006378174
0 references
