A note on the complexity of a phaseless polynomial interpolation (Q2307487): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126641154, #quickstatements; #temporary_batch_1719272490319 |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jco.2019.101456 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4389411 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Absolute value information for IBC problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040428 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCO.2019.101456 / rank | |||
Normal rank | |||
Latest revision as of 23:24, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of a phaseless polynomial interpolation |
scientific article |
Statements
A note on the complexity of a phaseless polynomial interpolation (English)
0 references
24 March 2020
0 references
information-based complexity
0 references
absolute value information
0 references
group action
0 references
polynomial interpolation
0 references
