Timeline for Finding unknown integer-valued polynomials using inequalities
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2010 at 21:48 | answer | added | fedja | timeline score: 2 | |
| Feb 1, 2010 at 21:14 | comment | added | Boris Bukh | 1) The best method does not have to use medians because it is conceivable that what is lost at a given step is regained at the next step. 2) A sensible approach might be to try proving that using means is a good algorithm, but though looking simpler, even finding a mean is a hard computational problem since it amounts to integration of a polynomial on a polyhedron. This is a computationally hard problem: see for example math.ucdavis.edu/~deloera/RECENT_WORK/integrationsimplex.pdf | |
| Feb 1, 2010 at 20:57 | history | edited | Anthony Peterson | CC BY-SA 2.5 |
changed function notation for g to subscripts
|
| Feb 1, 2010 at 20:55 | comment | added | Anthony Peterson | I can replace the g(q) notation with $g\_q$ if that makes more sense to use subscript notation. I was just trying to describe the set of guesses made in a compact way. Each guess of course depends on the answer from the previous one, so I can see why describing at as a function is confusing. | |
| Feb 1, 2010 at 17:10 | comment | added | TonyK | p is (obviously) the unknown polynomial. g is (as stated) your guess. | |
| Feb 1, 2010 at 16:16 | comment | added | Qiaochu Yuan | What are p and g? | |
| Feb 1, 2010 at 15:56 | history | asked | Anthony Peterson | CC BY-SA 2.5 |