hw_1 - CS 573: Algorithms, Fall 2009 Homework 1, due...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 573: Algorithms, Fall 2009 Homework 1, due Monday, September 14, 23:59:59, 2009 Version 1.0 Name: Net ID: Alias: # Score Grader 1. 2. 3. 4. 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 certificate 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 homework should be easier than hw0. You are encouraged to discuss problems in this homework with people, but should submit your homework on your own. 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,
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

hw_1 - CS 573: Algorithms, Fall 2009 Homework 1, due...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online