Discussion in 'TRIBE Main Forum' started by BigBadBaldy, Mar 12, 2002.
that's just wrong!!!!
i love you
Mr. Tosserofninjasalad was too long, his agent shortened it up.
better that than the drumstick.
do you think mr. t is teabaggin or rimjobbin the ninja?
I need some clarity for masturbatory purposes
ninjas don't wear combat boots though
homer had a chance to meet mr t once, he kept saying he'll go later, he'll go later, then when he finally did go he found out Mr.T. had just left and when he asked the mall guy if he'd ever be back he said he didnt know
quoting this so when you actually read through the thread and see that this was already pointed out it will be immortalized
not sure, i think he is trying to extract this though:
*cue entry into a dot on the polka dot door*
I can't believe that your rogers email address is raisetheroof
don't yell at joey. he's just a little slow
I did this when I confirmed it.
let me say it again:
BASS INVADER IS THE KING OF ROOFLES
chris! icq me when u're in town1
that pic makes me NP-hard
probably be back in may...
i don't know whats going on..i think weather changes make me act silly, that or reading complexity theory.
Re: that pic makes me NP-hard
WHAT!?!?! URE READING THE COMPLEXITY ANALYSIS THEORY!?!?!
I'm doing an assignment on it now..... Prof. Cook .. the guy who invented NP-completeness has designed our course.. i'm fuct.
cook isn't your teacher is he?!?
that's no fun, this stuff is really tough to get behind...
Cook is not teaching this year.
I got some other prof. And she has a particular way of complicating things. 80% drop rate by the 5th week of classes kind of says something about this course.....
Re: Re: that pic makes me NP-hard
i took his class, did pretty well in it actually
the exam was crazy though!!
although "invention" is a strong term, it's more like he took some unanswered questions further..
Re: Re: Re: that pic makes me NP-hard
Who was u'r prof? Did u take it with Tonian Pitassi?
She goes from Turing machines and RE reductions to NP completeness and then to greedy algorithms. All backwards...
there are 30 students left in class... we started with 150.
how about is deep and JIB shut the hell up?
ya that would be nice!
I DO WHAT I WANT
i just looked at your assignment, i don't have sipser handy but the stuff that's on the actual page doesn't look tooo bad..
here's a suggestion: get Garey and Johnson's book on NP Completeness, it was written in 1979 and will no doubt have probably every single NP Complete problem you will see in that class including reductions
(our tests were allways lifted right out of there)
Re: Re: Re: Re: that pic makes me NP-hard
i took it with Cook
You are looking at the wrong section.
Our assignment is exercises from the book Intro. To theory of computation by michael sipser.
here are the Q. that i'm stuck with now:
1. Show that if P=NP we can factor integers in polynomial time.
It is really not as simple as it looks...trust
2. prove that HALF-CLIQUE is in NP-COMPLETE.
half clique is the same as CLIQUE but only when the graph has a clique of size n/2 or more
Separate names with a comma.