J Mint
Reputation
Top tag
Next privilege 75 Rep.
Set bounties
 Feb9 comment Lower bound for matrix sorting? right. Ok, thanks. Feb9 comment Lower bound for matrix sorting? No, I understand that. But if T(n) is the time spent to get from an arbitrary matrix to a sorted matrix and S(n) is the time spent to get from a sorted matrix to a sorted array. Shouldn't you prove that $S(n)$ cannot be done in less than $n^2logn$ to prove that $T(n) \geq n^2logn+log(n^2!)$. Is giving one algorithm that runs in $n^2logn$ sufficient or do we have to prove it for all algorithms? Feb9 comment Lower bound for matrix sorting? I don't understand your conclusion (Therfore, ... ). How do you go from the problem of sorting the elements of a sorted matrix to the problem of sorting the matrix itself. Please, can you explain it to me? Feb3 comment Prove that a formal system is absolutely inconsistent @HenningMakholm can someone please just explain to me how I would go from a random wff to proving it's a theorem. Feb2 comment Prove that a formal system is absolutely inconsistent But isn't that what I had earlier, if we have A and ∼A∨B as well formed formula I can deduct B. Feb2 comment Prove that a formal system is absolutely inconsistent @Peter Ok. I'll rectify that. Thanks Jan23 comment Question about theta of $T(n)=4T(n/5)+n$ hmm, however it's different from what I get with the solved recurrence $T(n)=6n-5n^{2}n^{\frac{1}{log_{5}4}}=6n-5n^{2}n^{1.1}$ which should be almost $\theta(n^{3})$ Dec13 comment regular expression and intersection @Neil how may i use the function you provided? Dec13 comment regular expression and intersection Yes i am asked to use the intersection operator to make this string( which is a regular expression) shorter by coming up with languages whom the regular expression is shorter Dec13 comment regular expression and intersection yes this is exactly what i meant.