| Course Code | COMP6741 |
| Course Title | Parameterized and Exact Computation |
| Units of Credit | 6 |
| Course Website | http://cse.unsw.edu.au/~cs6741 |
| Handbook Entry | http://www.handbook.unsw.edu.au/undergraduate/courses/current/COMP6741.html |
| Lecturer in charge | Serge Gaspers |
The course focuses on algorithms for exactly solving NP-hard computational problems. Since no polynomial time algorithm is known for any of these problems, the running time of the algorithms will have a super-polynomial dependence on the input size or some other parameter of the input.
The first part presents algorithmic techniques to solve NP-hard problems provably faster than brute-force in the worst case, such as branching algorithms, dynamic programming across subsets, inclusion-exclusion, local search, and measure & conquer. We will also see lower bounds for algorithms and how to rule out certain running times assuming the (Strong) Exponential Time Hypothesis.
Whereas the first part presents "default" algorithms that one would use without knowing much about the instances one is about to solve, the second part acknowledges that the complexity of an instance does not only depend on its size n. A parameter k is associated with each instance and the parameterized complexity framework aims at designing fixed-parameter algorithms whose running times are f(k)*poly(n) for a computable function f. This gives efficient algorithms for small values of the parameter obtained via techniques such as branching, colour coding, iterative compression, and kernelization (preprocessing). We will also see problems that are not fixed-parameter tractable and not kernelizable to polynomial kernels subject to complexity-theoretic assumptions.
The course timetable is available here .
Consultations: by request.
NP-hard problems are often at the core of the most challenging, rewarding, and lucrative computational problems in all areas of science and technology. This course will outline principled ways to approach these problems and will give students a better understanding of when and why NP-hard computational problem can be solved with reasonable resources.
After completing the course, students are able to
| Graduate Capability |
| scholarship: capable of independent and collaborative enquiry |
| scholarship: rigorous in their analysis, critique, and reflection |
| scholarship: able to apply their knowledge and skills to solving problems |
| scholarship: capable of effective communication |
| scholarship: information literate |
| scholarship: digitally literate |
| leadership: enterprising, innovative and creative |
| leadership: capable of initiating as well as embracing change |
| leadership: collaborative team workers |
| professionalism: capable of independent, self-directed practice |
| professionalism: capable of lifelong learning |
| global citizens: capable of applying their discipline in local, national and international contexts |
This course is taught the way it is because interleaving lectures with exercises enhances problem-solving capabilities and fortifies the understanding of newly learned concepts.
The assignments further enhance problem-solving at the students' own pace.
The exams confront students with additional problems and test their understanding of concepts and problem-solving capabilities.Assignments. There are three assignments. Assignment 2 is a group assignment (3-4 students). Assignments 1 and 3 are individual assignments. Each student receives one mark for Assignment 1, two marks for Assignment 2, and one mark for Assignment 3. The assignment mark of a student is the average of the top three of these marks.
Late Assignment Submission Policy. Submitting x days after the deadline, with x > 0, reduces the grade by 20 · x per cent.
Exams.
The midterm and the final exam are written open-book exams.
| Assignments | 25% |
| Midterm | 25% |
| Final exam | 50% |
To pass the course, the final mark, calculated as outlined above, needs to be at least 50. Students in their final year of studies achieving a final score of 47-49 can take a supplementary oral exam in which they have to achieve a mark of at least 50 to pass with a final mark of 50.
If your work in this course is affected by unforeseen adverse circumstances, you should apply for Special Consideration through MyUNSW, including documentation on how your work has been affected. If your request is reasonable and your work has clearly been impacted, then
Note the use of the word "may". None of the above is guaranteed. It depends on you making a convincing case that the circumstances have clearly impacted your ability to work.
If you are registered with Disability Services, please forward your documentation to the lecturer in charge within the first two weeks of the semester.
The Student Code of Conduct ( Information , Policy ) sets out what the University expects from students as members of the UNSW community. As well as the learning, teaching and research environment, the University aims to provide an environment that enables students to achieve their full potential and to provide an experience consistent with the University's values and guiding principles. A condition of enrolment is that students inform themselves of the University's rules and policies affecting them, and conduct themselves accordingly.
In particular, students have the responsibility to observe standards of equity and respect in dealing with every member of the University community. This applies to all activities on UNSW premises and all external activities related to study and research. This includes behaviour in person as well as behaviour on social media, for example Facebook groups set up for the purpose of discussing UNSW courses or course work. Behaviour that is considered in breach of the Student Code Policy as discriminatory, sexually inappropriate, bullying, harassing, invading another's privacy or causing any person to fear for their personal safety is serious misconduct and can lead to severe penalties, including suspension or exclusion from UNSW.
If you have any concerns, you may raise them with your lecturer, or approach the School Ethics Officer , Grievance Officer , or one of the student representatives.
Plagiarism is defined as using the words or ideas of others and presenting them as your own. UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism. In particular, you are also responsible that your assignment files are not accessible by anyone but you by setting the correct permissions in your CSE directory and code repository, if using. Note also that plagiarism includes paying or asking another person to do a piece of work for you and then submitting it as your own work.
UNSW has an ongoing commitment to fostering a culture of learning informed by academic integrity. All UNSW staff and students have a responsibility to adhere to this principle of academic integrity. Plagiarism undermines academic integrity and is not tolerated at UNSW. Plagiarism at UNSW is defined as using the words or ideas of others and passing them off as your own.
If you haven't done so yet, please take the time to read the full text of
The pages below describe the policies and procedures in more detail:
You should also read the following page which describes your rights and responsibilities in the CSE context:
Indicative schedule of lecture topics
| Week | Lectures |
| 1 | Introduction; Dynamic programming |
| 2 | Branching algorithms |
| 3 | Branching algorithms; Inclusion-Exclusion |
| 4 | Basics of Parameterized Complexity; Kernelization |
| 5 | Kernelization; Parameterized Branching Algorithms |
| 6 | Midterm; Parameterized Intractability: the W-hierarchy - guest lecture by Shenwei Huang |
| 7 | Parameter Treewidth |
| 8 | Iterative Compression |
| 9 |
Randomized methods and color-coding - guest lecture by Edward Lee
|
| 10 | Kernel lower bounds |
| 11 | Exponential time hypothesis |
| 12 | Exponential time hypothesis; Review of covered topics |
| 13 |
no lecture
|
Assignment schedule
| Assignment | announced on | submit by | feedback on |
| 1 | 02 August 2017 | 16 August 2017 | 30 August 2017 |
| 2 | 16 August 2017 | 20 September 2017 | 04 October 2017 |
| 3 | 20 September 2017 | 11 October 2017 | 25 October 2017 |
Recommended readings
Other useful resources
This course is evaluated each session using the myExperience system.
In the previous offerings of this course, no substantial deficiencies were notes. Students did however make helpful comments on how to improve the course.
Based on their comments, improvements have been made to the course handouts for both black-and-white and color printing, the structure of lectures, and a timeline has been set for feedback on assignments.
Resource created Thursday 20 July 2017, 04:20:53 PM, last modified Friday 21 July 2017, 01:47:01 PM.