COMP6741 Algorithms for Intractable Problems (UNSW Sydney): rated 4.2/5 overall across 3 reviews collected on UNSW Wall.
COMP6741 is a UNSW Sydney course taught by the Faculty of Engineering in School of Computer Science and Engineering. This page brings together its handbook details and what UNSW students say about it.
Review data updated 2026-10-24.
Chinese title: 难解问题算法
Type: Undergraduate course
Credit points: 6
Subject area: School of Computer Science and Engineering
Faculty: Faculty of Engineering
Level: Postgraduate Level 6
Handbook year: 2026
The course focuses on algorithms for solving intractable computational problems, so-called NP-hard problems. Ideally, one would want to design algorithms that solve each instance exactly and in polynomial time.
COMP6741 has 3 scored reviews: overall 4.2/5 (all out of 5; higher difficulty means harder).
Sources: 3 Reddit comments that an AI model judged to be reviewing this course (average would-recommend 4.2/5).
On Reddit: "I have a few, coming from a CompSci / Math student who specialises in theoretical cs. These are just the few that are available in T1. * **COMP4141**: One of my first introductions to cs theory, and it was such an enjoyable experience. It was the right amount of difficulty for m…"
On Reddit: "It is a fantastic course, especially if you’re someone who is very much into the theory side of computer science. You learn about a lot of techniques used in modern algorithm literature when tackling problems that are computationally hard (ie NP-hard) and part of your assessment…"
The course panel on UNSW Wall shows every review and discussion in full.
Q: Is COMP6741 worth taking?
A: Averaged over 3 reviews: overall 4.2/5.
Q: Which faculty teaches COMP6741, and when is it offered?
A: COMP6741 is taught by the Faculty of Engineering. Check the official handbook for the current year.
UNSW Wall is an independent student community and is not affiliated with UNSW Sydney.