Comments for cs3102: Theory of Computation

Comment on PS7 Submissions by compsci2000

compsci2000 — Wed, 05 May 2010 05:13:23 +0000

Resubmission on Link!

a. Adis Ljubovic

b. The target audience is people who are familiar with the P vs. NP problem and possibly familiar with Maximum Independent Set Problem(called INDEPENDENT-SET problem in comic).

https://doc-14-8k-docs.googleusercontent.com/docs/secure/rb76hs62dof3nkvdingba5cedl9ltjag/6cuel3qtkkepbpb78fssgrb0eit6ip1p/1273017600000/11502889419769978290/*/0BxF1vtXLmw7pZjE5ZTYyN2UtNjAxNC00NzZjLTg1OWMtZjU5YzdjMmVjNDBi?h=03491947472532422739

Footnote: The purpose of the cartoon is to demonstrate that people should be aware of when problems are NP complete, and that they should not waste their time on these problems that probably can’t be solved efficiently.

The problem in the comic is basically the Maximum Independent set problem, which is the problem of finding the largest set of vertices where no vertices are adjacent(connected by a single edge). Each person is represent by a vertex, and hatred between two people is represented by an edge(if two people get along, they do not have an edge connected them).

Comment on PS7 Submissions by em2ae

em2ae — Tue, 04 May 2010 23:30:35 +0000

http://www.youtube.com/watch?v=GSIodz9GWxc

Uploaded to youtube for easier access.

Comment on PS7 Submissions by Ryan Matt

Ryan Matt — Tue, 04 May 2010 21:02:35 +0000

Forgot to explain: The cake represents the ambiguity between the P and NP sets. If you look at the top of the cake, you see the two distinct sets (P is represented by the green and NP is represented by the NP. If you look at the side of the cake, they’re both one contiguous set.

Comment on PS7 Submissions by no1lakersfan2007

no1lakersfan2007 — Tue, 04 May 2010 18:26:40 +0000

I have determined that there is a hidden meaning in this comic that is not necessarily evident at first, as it was not evident to me until now. Because the father was convinced rather quickly that his son would not give up on programming and actually clean his room, he made the decision in polynomial time.

However, because the child still continues to program even after hearing what his father said, it will take him quite a long time to figure out he will never be able to solve the problem of cleaning his room, and that it would be better to just do it himself. The child is representative of NP as he will keep looking for a way to solve the problem until it happens.

Comment on PS7 Submissions by Tryg

Tryg — Tue, 04 May 2010 17:59:58 +0000

Trygve Loken
https://docs.google.com/a/virginia.edu/Doc?docid=0AUoXLDfF4D26ZGN4ejg1NnZfNGQ4NTJrMmhi&hl=en

Comment on PS7 Submissions by mba5j

mba5j — Tue, 04 May 2010 17:59:56 +0000

a. Mohamed Amin
b. UPS director (who should be semi-knowledgeable of P=NP and turing machines)
c. http://docs.google.com/document/edit?id=1Lmm6W1-Dt0Moh8FYCsln2q_MAFkwvtd9LASgVPqDr1k&hl=en

Comment on PS7 Submissions by Rich

Rich — Tue, 04 May 2010 17:55:52 +0000

a. Richard Dodson – red8q@virginia.edu
b. College CS students who have a basic understanding of complexity theory.
c. http://people.virginia.edu/~red8q/CS%203102/OpenProblem/

Comment on PS7 Submissions by Ben Powell

Ben Powell — Tue, 04 May 2010 17:49:41 +0000

a. Navid Hosseini, John Koelling, Trung Tran, Ben Powell
b. Middle School students
c. http://www.youtube.com/watch?v=PeRRF3jrHbQ and also a themed cake to be consumed during class.

Comment on PS7 Submissions by Robyn Short

Robyn Short — Tue, 04 May 2010 17:48:05 +0000

a. Robyn Short
b. Professor Evans
c. https://docs.google.com/a/virginia.edu/fileview?id=0B3blCSKEUiMTMTEzMWNjMjEtYzMwYy00YTE4LWJlMTUtN2NlNTBmYjI2ZGY1&hl=en

Comment on PS7 Submissions by dk8p

dk8p — Tue, 04 May 2010 17:25:57 +0000

a. Duon Ki
b. People who knows about P=NP problem
c. http://sphotos.ak.fbcdn.net/hphotos-ak-snc3/hs304.snc3/28805_1448476694529_1311543924_1259928_1563438_n.jpg