Complexity of Finding Values of the Generalized Taxicab Number
Journal of Advances in Mathematics and Computer Science · pp. 361–365 · Published 15 Jul 2015
10.9734/BJMCS/2015/17549Abstract
This short paper demonstrates a sketch of a generic algorithm that can generate integers written as the sum of N mth positive powers with any N≥2 and m≥1 in two different ways. As it is shown in the paper, such a generic algorithm is NP-hard. One can infer from this result that to generate exact values of the generalized "Taxicab" (m,N,j)– the smallest sum of N mth positive powers expressed in j different ways – is at least as hard as the hardest problems in NP. This implies that except for small N to find the generalized "Taxicab " (m,N,j) would be unfeasible on any computing device.
Cited by 0
No indexed citations yet.
Related research
- Evaluation of the Performance of Martial Art Wushu Sportsmen by Measuring the System Complexity — shares topic coverage
- An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs — shares topic coverage
- Entropy in the Analysis of Gait Complexity: A State of the Art — shares topic coverage
- Perceived Attributes of Soybean Production Technologies — shares topic coverage
- Validation of the Area1 of Approximate Entropy (a1ApEn) in Empirical Data of Heart Rate — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.