meta user
network profile
| bio | website | cs.uiuc.edu |
|---|---|---|
| location | Urbana, IL | |
| age | ||
| visits | member for | 2 years, 9 months |
| seen | May 14 at 0:20 | |
| stats | profile views | 125 |
No, I am a meat popsicle.
|
Apr 14 |
comment |
What philosophical consequence of Goedel's incompleteness theorems? Administrator cannot consistently believe this sentence to be true. |
|
Apr 14 |
comment |
What philosophical consequence of Goedel's incompleteness theorems? @EMS: Please take this to chat. |
|
Apr 12 |
answered | Connecting all points on a plane with shortest path possible |
|
Apr 11 |
comment |
Notation : What is the meaning of the (mod n) in factoring algorithms? Nope. % and mod are different for negative numbers. (Alternatively: % is busted.) |
|
Apr 11 |
comment |
Are these two statements equivalent? I think the correct conclusion is Never use "unless...not" in a mathematical context. |
|
Apr 11 |
comment |
Improving Gift Wrapping Algorithm By "angles", you means "slopes", of course. Trigonometry is anathema to actual implementation. |
|
Apr 11 |
comment |
Notation: What is the meaning of “$(a,b)$” I disagree that never using "," to mean "and" is "an annoying constraint"; I consider an ironclad rule. I would write your example as $\{(x,y)\in\mathbb{R^2} \mid x\ge 1 \text{ and } 0\le y\le x^2\}$. Yes, with "and" spelled out. |
|
Apr 11 |
suggested | suggested edit on Notation: What is the meaning of “$(a,b)$” |
|
Apr 8 |
comment |
When do floors and ceilings matter while solving recurrences? These notes might help; see especially Section 6. |
|
Apr 8 |
comment |
How can we show that $\mathbb Q$ is not free? "Free" in what sense? |
|
Mar 28 |
comment |
My last question was perhaps not clear!! No. Let $g_1 = 2$ and $g_2 = 3$ in the group $G = \mathbb{Z}$. |
|
Mar 22 |
comment |
Asymptotic equality @martini is correct. The equation, as written, is false. |
|
Mar 19 |
comment |
A finite graph with exactly two vertices with odd degree must have a path joining them. That graph does not have exactly two vertices of odd degree. |
|
Mar 19 |
comment |
Is this summation$O(n^2)$? So to answer the actual question: NO |
|
Mar 19 |
suggested | suggested edit on Proving $T(n) \ge 2^{n/2}$, for all n, by induction |
|
Mar 18 |
comment |
Algorithm for Identifying Convex Kernel @StevenTaschuk: You should upgrade your comment to an answer. |
|
Mar 16 |
comment |
Time complexity of algorithm computing averages Also asked and closed on MathOverflow. |
|
Mar 15 |
comment |
Time complexity of algorithm computing averages "This is my last exam at the university"? Wait... this is an EXAM problem? |
|
Mar 15 |
comment |
Time complexity of algorithm computing averages This question was already asked on cstheory.se; it was quickly closed for being off-topic. |
|
Mar 6 |
comment |
Particular Use of Big O Notation Perhaps "for all sufficiently large $j$ and sufficiently small $\epsilon>0$". |
