# hw1(11) - CS CS 473g Algorithms Fall 2007 Homework 1(due...

This preview shows pages 1–3. Sign up to view the full content.

CS CS 473g: Algorithms, Fall 2007 Homework 1 (due Thursday, September 13, 2007 at 11:59.99 p.m.) Version 1.04 Name: Net ID: Alias: Name: Net ID: Alias: # Score Grader 1. 2. 3. 4. 5. Total Neatly print your name(s), NetID(s), and the alias(es) you used for Homework 0 in the boxes above. Staple this sheet to the top of your homework. If you are on campus, submit the homework by submitting it in SC 3306 (or sliding it under the door). Note: You will be held accountable for the appropriate responses for answers (e.g. give models, proofs, analysis, etc). For NP-Complete problems you should prove everything rigorously, i.e. for showing that it is in NP , give a description of a certiﬁcate and a polynomial time algorithm to verify it, and for showing problems are NP-Hard , you must show that your reduction is polynomial time (by similarly proving something about the algorithm that does the transformation) and proving both directions of the ‘if and only if’ (a solution of one is a solution of the other) of the many-one reduction.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Only of myself I know how to tell, my world is as narrow as an ant’s. like an ant too my burden I carry, too great and heavy for my frail shoulder. My way too - like the ant’s to the treetop - is a way of pain and toil; a gigantic hand, assured and malicious, a mocking hand hinders All my paths are made bleak and tearful by the constant dread of this giant hand. Why do you call to me, wondrous shores?
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

hw1(11) - CS CS 473g Algorithms Fall 2007 Homework 1(due...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online