Method and system for solving subset sum matching problem using search approach
US12235848B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 12, 2023 |
| Grant date | Feb 25, 2025 |
| Priority date | — |
| Expiry date | Jun 12, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2255
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Methods and systems for performing a combinatorial optimization task are provided. The method includes: receiving a first set of data items and a second set of data items; dividing the second set of data items into a first subset and a second subset; generating, based on the first subset, a first set of subset sums, and storing the first set of subset sums as a list; generating, based on the second subset, a second set of subset sums, and storing the second set of subset sums as a hash-map in conjunction with a corresponding hash function; and detecting, based on the first set of data items, the list, and the hash-map, at least one match between a subset sum that corresponds to the second set of data items and a subset sum that corresponds to the first set of data items.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.