okay back on topic
52 Replies - 11161 Views - Last Post: 05 October 2011 - 04:39 AM
#31
Re: JUMP
Posted 23 May 2009 - 04:41 AM
yes i did know that lol.
okay back on topic
okay back on topic
#33
Re: JUMP
Posted 26 May 2009 - 12:33 PM
he wasn't always bad though, he only stopped caring <3
#34
Re: JUMP
Posted 28 May 2009 - 05:34 AM
Gloin, on 23 May, 2009 - 10:03 AM, said:
That's still not the issue but since you mention it, it's rather useful to prove that 1 != 2. If you can't do that then all mathematics would fail, wouldn't it?!
P denotes the class of problems that can be solved in polynomial-time.
NP denotes the class of non-deterministic polynomial problems, meaning they could be solved in polynomial time using a non-deterministic Turing machine (if you have one of those, I'm ready to buy).
P is in the class of NP but not equal to it (most likely). Other parts of the NP class are the NP-Complete class and the class of incomplete problems.
When talking about problems, it's usually assumed to be decision problems (yes/no) but since a decision problem can be used to solve an optimization problem the optimization problem is in P if the decision problem is in P. You only use a method similar to the binary search method (which only adds a multiplicative factor O(c*log(n))) to convert the decision problem into an optimization problem.
Am I turning this into a CS thread now?
I'm sorta guessing you knew this already but in case someone else didn't..
P denotes the class of problems that can be solved in polynomial-time.
NP denotes the class of non-deterministic polynomial problems, meaning they could be solved in polynomial time using a non-deterministic Turing machine (if you have one of those, I'm ready to buy).
P is in the class of NP but not equal to it (most likely). Other parts of the NP class are the NP-Complete class and the class of incomplete problems.
When talking about problems, it's usually assumed to be decision problems (yes/no) but since a decision problem can be used to solve an optimization problem the optimization problem is in P if the decision problem is in P. You only use a method similar to the binary search method (which only adds a multiplicative factor O(c*log(n))) to convert the decision problem into an optimization problem.
Am I turning this into a CS thread now?
I'm sorta guessing you knew this already but in case someone else didn't..
Do you wanna trade your brain for my sexy?
#35
Re: JUMP
Posted 28 May 2009 - 05:41 AM
What sexy?
And I would say the day I signed up for DIC so I can relive the moment <3
And I would say the day I signed up for DIC so I can relive the moment <3
This post has been edited by NeoTifa: 28 May 2009 - 05:42 AM
#36
Re: JUMP
Posted 28 May 2009 - 05:42 AM
What do I get in between? It's not exactly an even trade..
#37
Re: JUMP
Posted 28 May 2009 - 06:20 AM
Hmmm, prolly my birth and to stop it lol
This post has been edited by pakkuman_shinde: 28 May 2009 - 06:21 AM
#38
Re: JUMP
Posted 28 May 2009 - 06:24 AM
#39
Re: JUMP
Posted 28 May 2009 - 06:29 AM
ROFDIL!!!
@pakkuman don't say that dude. life sucks, but don't joke about death, abortion and suicide. that stuff's not a joke dude and that's me saying it.
@pakkuman don't say that dude. life sucks, but don't joke about death, abortion and suicide. that stuff's not a joke dude and that's me saying it.
#40
Re: JUMP
Posted 30 May 2009 - 09:23 PM
April, 2008, stop my bitch shrink for putting me on meds that made me fall down a flight of stairs and fall into a coma
#41
Re: JUMP
Posted 30 May 2009 - 09:24 PM
Yesterday, I'd redo it with the knowledge of today.
#42
Re: JUMP
Posted 30 May 2009 - 10:18 PM
04/19/09
Should've told her how much I love her.
Should've told her how much I love her.
This post has been edited by Project 2501: 30 May 2009 - 10:18 PM
#43
Re: JUMP
Posted 01 June 2009 - 09:07 AM
would it have changed anything? would it be worth putting yourself in that position?
#44
Re: JUMP
Posted 02 June 2009 - 01:13 PM
Yes. I do believe it would have changed a lot of things. Oh well. What's done is done.
#45
Re: JUMP
Posted 02 June 2009 - 01:30 PM
*hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs**hugs*
|
|

New Topic/Question

MultiQuote












|