Algorithms for Intractable Problems
UNSW Sydney · NSW · COMP6741
Algorithms for Intractable Problems is a subject at UNSW Sydney, NSW in School of Computer Science and Engineering. It covers topics like algorithms, computational-mathematics, computer-science. It is part of 3 degrees. The information below is compiled from public course material — approximate, not official.
UNSW Sydney
COMP6741
6.00
School of Computer Science and Engineering
Topics covered
Degrees that include Algorithms for Intractable Problems
Frequently asked questions
What is Algorithms for Intractable Problems about?
Algorithms for Intractable Problems covers topics like algorithms, computational-mathematics, computer-science.
Which degrees include Algorithms for Intractable Problems?
Algorithms for Intractable Problems is part of 3 degrees, including Information Technology, Information Technology, Information Technology.
How many credit points is Algorithms for Intractable Problems?
Algorithms for Intractable Problems at UNSW Sydney is typically around 6.00 credit points. Approximate — confirm with the university.
Where is Algorithms for Intractable Problems taught?
Algorithms for Intractable Problems is taught at UNSW Sydney, NSW.
Studying Algorithms for Intractable Problems?
Peernovo helps students research, choose and thrive at university — across Australia, the US, the UK and Canada — powered by our AI backbone:
- Explore & compare degrees — across universities and countries with honest, specific information.
- "What Can I Be?" career guidance — an AI pathway councillor that maps degrees to careers.
- See who's studying — your degree at your university — find classmates and study groups.
- AI Task Coach — a Socratic study companion that plans your work around your life.
- Honours & Thesis Research Coach — structure and move your research project forward.
- Smart study planner, exam prep and a daily digest — to keep you on track.
Sources: UNSW Sydney public course catalogue. Information is compiled and summarised — not copied verbatim — and is approximate; always confirm with the original source.
Something not right on this page, or want it changed? Let us know and we'll review it.