NP-hardness of Reed-Solomon decoding and the Prouhet-Tarry-Escott problem (Q6946420)
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 8076587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of Reed-Solomon decoding and the Prouhet-Tarry-Escott problem |
scientific article; zbMATH DE number 8076587 |
Statements
NP-hardness of Reed-Solomon decoding and the Prouhet-Tarry-Escott problem (English)
0 references
6 August 2025
0 references
