Timeline for Detecting slow growth in a finite number of queries
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2020 at 10:54 | answer | added | Erel Segal-Halevi | timeline score: 0 | |
| Sep 10, 2020 at 11:17 | answer | added | Erel Segal-Halevi | timeline score: 0 | |
| Sep 8, 2020 at 2:22 | comment | added | Iosif Pinelis | @RodrigodeAzevedo : I have had very little experience in computer science. However, it appears that the author of the linked question (whose tags I borrowed here) is a computer scientist. So, it appears to me that for some computer scientists the approximation-algorithms tag seems appropriate. | |
| Sep 7, 2020 at 20:58 | comment | added | Rodrigo de Azevedo | I don't want to be too annoying and split hairs that no one cares about, but both questions have a computer science "feel" combined with real analysis. However, an algorithm that approximates something is not an approximation algorithm as used by computer scientists — the tag description has a CS bent. The semidefinite programming approach to MAX-CUT is an approximation algorithm, however. | |
| Sep 7, 2020 at 20:47 | comment | added | Iosif Pinelis | @RodrigodeAzevedo : Here I used the tags used for the linked question. I think the approximation algorithm here is given by the choice of the query points, to approximate the functions $g$ and $g^{-1}$ by their restrictions to the corresponding sets of the query points, in order to detect slow growth. | |
| Sep 7, 2020 at 20:08 | comment | added | Rodrigo de Azevedo | How is this related to approximation algorithms? | |
| S Sep 7, 2020 at 18:50 | answer | added | Iosif Pinelis | timeline score: 2 | |
| S Sep 7, 2020 at 18:50 | history | asked | Iosif Pinelis | CC BY-SA 4.0 |