wiki claimt trouwens, if ∃ one-way then P /= NP
oops wrong channel ;)
R496: might be wrong channel, but i find it interesting anyway.. tell us more!
Heh.
up_the_irons: the discussion was about one-way functions, which are important in modern cryptography but their existence seems to be an open question. However, if they do exist, that will imply that P /= NP (http://en.wikipedia.org/wiki/One-way_function)
R496: ah cool
Interesting.
up_the_irons: which university?
R496: UCLA
ah I probably could have guessed that :)
why?:)
considering the location of arp-networks
ah yeah
I sometimes use my ucla.edu email address, but not too much...
anyway, algorithms and complexity courses can be quite painfull
I really enjoyed those courses. Though I struggled, I still did pretty well and got a lot from them.
I wish I used that stuff more in my day to day.
up_the_irons: Northeastern took away our email addresses after we graduated. Fortunately, the college of computer science has their own infrastructure, so I still have a ccs.neu.edu address.
yeah, solving those hard problems can be quite rewarding
mhoran: yeah, UCLA used to do the same, and your only memorable email would be if you signed up to the UCLA Alumni network, and you got a dumb uclalumni.net email address.  HOWEVER, the class gift of 2003 (the year before i graduated) was a donation to build an email forwarding service that let everyone keep their ucla.edu addresses after graduation.  w00t
R496 mhoran : I liked Algorithms and Complexity class, although it was quite dry and hard at times
i still remember: NP-Complete = 1) NP-hard, 2) in NP
it is somewhat important that you know the classes of problems you aren't going to optimize (or if you do you'll have solved the biggest CS problem of today), so that you don't waste time looking for them (in a commercial sense)
Yeah, definitely.