884 reputation
313
bio website
location
age
visits member for 2 years, 8 months
seen 2 days ago

Nov
4
comment Complexity of Towers of Hanoi
@JeffE and Kaveh: I'm very delighted that this question has garnered so many views. I'm equally delighted to blame this on both of you. You guys are completely culpable of helping me on the path to clear thinking.
Oct
25
awarded  Notable Question
Jun
24
comment Trigonometry in computer science
E.g See en.wikipedia.org/wiki/Point_in_polygon for inside-outside test. You could do this by summing the interior angles at a point and see whether you get 2pi - but due to finite precision effects you don't. That's my last comment.
Jun
24
comment Trigonometry in computer science
No I don't. I was merely referring to CG's inclination to avoid floating point computations - esp trig functions.
Jun
23
awarded  Nice Answer
Apr
2
awarded  Yearling
Jan
19
awarded  Nice Question
Jul
3
accepted A hard $n$-fold integral
Jul
3
answered A hard $n$-fold integral
Jun
28
comment What is the meaning of $O(m+n)$?
+1, I for one agree with that last sentence!
Jun
28
comment A hard $n$-fold integral
I took a call on this question and posted a copy on MO: mathoverflow.net/questions/135076/an-np-hard-n-fold-integral
Jun
25
asked A hard $n$-fold integral
Apr
2
awarded  Yearling
Mar
8
awarded  Nice Question
Jan
13
awarded  Popular Question
Nov
2
awarded  Citizen Patrol
Oct
30
comment How to prove $L \cdot L^{*} = L^{+}$
What about a concrete example :$L=\{0,1\}$? Can you extend this to a finite alphabet?
Oct
27
answered Trigonometry in computer science
Oct
26
revised Adjacent house , dynamic programming problem
added 212 characters in body
Oct
25
comment Adjacent house , dynamic programming problem
Yes, you should be able to make do with a 1D array.