Equal-subset-sum faster than the meet-in-the-middle (Q5075820)
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 7525510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equal-subset-sum faster than the meet-in-the-middle |
scientific article; zbMATH DE number 7525510 |
Statements
11 May 2022
0 references
equal-subset-sum
0 references
subset-sum
0 references
meet-in-the-middle
0 references
enumeration technique
0 references
randomized algorithm
0 references
0.8402222394943237
0 references
0.8062824606895447
0 references
0.8057849407196045
0 references
0.8049734830856323
0 references
0.8041111826896667
0 references
