A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
In computer science and mathematics, a partition of a set into two or more disjoint subsets with equal sums is a well-known NP-complete problem. This is a hard problem and referred to as the partition problem or number partitioning. In this paper, we solve a particular type of NP-complete problem on...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Chemistry |
| Online Access: | http://dx.doi.org/10.1155/2022/1587689 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|