jiji777

57 reputation

bio	website
	location
	age
visits	member for	7 months
	seen	Mar 17 at 23:53
stats	profile views	6

	57 reputation	bio	website		visits	member for	7 months
6 badges		location			seen	Mar 17 at 23:53

summary answers questions tags badges favorites bounties reputation activity

33 Actions

suggestions reviews revisions comments badges posts accepts all

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$
Mar 14	revised	Find a path in directed acyclic weighted graph with constraints added 116 characters in body
Mar 14	revised	Find a path in directed acyclic weighted graph with constraints added 12 characters in body
Mar 14	asked	Find a path in directed acyclic weighted graph with constraints
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