J Mint
Reputation
Top tag
Next privilege 75 Rep.
Set bounties
 Jul 2 awarded Curious Mar 21 awarded Tumbleweed Mar 17 accepted Ramsey's theory inequality with $t$-subsets Mar 17 asked Ramsey's theory inequality with $t$-subsets Mar 16 accepted The Ramsey number $r(t,t,q)$ with $q\geq t$ Mar 16 asked The Ramsey number $r(t,t,q)$ with $q\geq t$ Feb 9 accepted Lower bound for matrix sorting? Feb 9 comment Lower bound for matrix sorting? right. Ok, thanks. Feb 9 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? Feb 9 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? Feb 9 awarded Commentator Feb 8 awarded Scholar Feb 8 revised Lower bound for matrix sorting? added 3 characters in body Feb 8 awarded Supporter Feb 8 asked Lower bound for matrix sorting? Feb 3 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. Feb 2 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. Feb 2 revised Prove that a formal system is absolutely inconsistent added 11 characters in body Feb 2 comment Prove that a formal system is absolutely inconsistent @Peter Ok. I'll rectify that. Thanks Feb 2 revised Prove that a formal system is absolutely inconsistent edited tags