Skip to main content

Timeline for An NP-hard $n$ fold integral

Current License: CC BY-SA 3.0

14 events
when toggle format what by license comment
Apr 13, 2017 at 12:48 history edited CommunityBot
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
S Jul 11, 2013 at 5:45 history suggested Kaveh CC BY-SA 3.0
fixing a typo (and a bit of rewording to make the edit more than 6 charaters)
Jul 11, 2013 at 5:40 review Suggested edits
S Jul 11, 2013 at 5:45
Jul 2, 2013 at 16:55 vote accept Ganesh
Jul 2, 2013 at 7:21 answer added Johan Wästlund timeline score: 11
Jul 2, 2013 at 6:28 comment added Johan Wästlund ...only with the interval $[0,1]$ turned backwards, and general $c_i$. This is a different type of question, but is there a connection to the Last-Arrival problem?
Jul 2, 2013 at 6:25 comment added Johan Wästlund I just want to point out that the integral is essentially the same as the one that occurred in the question on "The Bruss-Yor conjecture about an iterated integral", mathoverflow.net/questions/100599/…
S Jul 2, 2013 at 6:17 history suggested Kaveh CC BY-SA 3.0
formatting, adding tags
Jul 2, 2013 at 5:55 review Suggested edits
S Jul 2, 2013 at 6:17
Jul 2, 2013 at 5:37 comment added Ganesh @Kaveh: Revised.
Jul 2, 2013 at 5:36 history edited Ganesh CC BY-SA 3.0
Revised question per comments; added a tag
Jul 1, 2013 at 16:12 comment added Ganesh @Kaveh, I am not clear about your comment. Could you elaborate it into an answer?
Jun 28, 2013 at 12:53 comment added Noah Stein Another way to think about this problem is computing the volume of the intersection of a simplex and a hypercube. This is a particular polytope defined by facets, but this is not immediately helpful because computing the volume of a polytope defined by facets is #P-hard in general, but this type of polytope could be easier.
Jun 28, 2013 at 0:59 history asked Ganesh CC BY-SA 3.0