[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.6226626 [View]
File: 85 KB, 756x563, 1387080187448.png [View same] [iqdb] [saucenao] [google]
6226626

>>6226619
>Sophomore studying CS at Berkeley

Find professors Papadimitriou and Vazirani and tell them they are bloody retards that should have their PhD's revoked.

>> No.5551278 [View]
File: 85 KB, 756x563, Insults mathematcians everywhere.png [View same] [iqdb] [saucenao] [google]
5551278

>Algorithms, Dasgupta et al

This needs to be deleted of the book list immediately. Worst piece of shit ever

>> No.4722721 [View]
File: 85 KB, 756x563, Insults mathematcians everywhere.png [View same] [iqdb] [saucenao] [google]
4722721

>>4722681
this is what an average CS textbook has inside it.

>> No.4503823 [View]
File: 85 KB, 756x563, Insults mathematcians everywhere.png [View same] [iqdb] [saucenao] [google]
4503823

>>4503800
>you know the NP problem is one of the clay mathematics millenium prizes?

You know most CS students, CS grad students, CS professors, and even CS textbook authors have a extremely shitty understanding of the NP problem and most real work done on it is by real Mathematician when they're bored/free.

>> No.4365824 [View]
File: 85 KB, 756x563, Insults mathematcians everywhere.png [View same] [iqdb] [saucenao] [google]
4365824

>>4365611
No, it simply isn't

>>4365620

I highly doubt it. People in theoretical CS can't do real math. One grad student once argued for days trying to say MST are in NP complete (*functional) until I went to his adviser to get him throw out of the program and deported. Another once refused to believe that that (R,+, <) is isomorphic to (R>0,*,<). Another one couldn't understand that solving a problem in DNF or sum of products was in P. Another refused to believe RSA couldn't be broken because it has "The same time complexity of TSP and hence is NP". A PROFESSOR once gave and entire lecture stating NP problems are complete if there doesn't exist a polynomial time checker; when I brought up that you can check SAT in linear time everyone just stared at me like I went crazy. I can go on and on about profound misunderstanding of math just like this by 'theoretical' CS staff.

Hell, just look at their extremely incorrect textbooks

Navigation
View posts[+24][+48][+96]