国际学生入学条件
A four-year Honours Bachelor degree or its equivalent in mathematics or in a closely related field with a 78% overall average or its equivalent for undergraduate work.
Applicants from foreign countries must normally take the Graduate Record Examinations (GRE) General Test and Subject Tests.
Three references, normally from academic sources
Proof of English language proficiency, if applicable. TOEFL 90 (writing 25, speaking 25), IELTS 7.0 (writing 6.5, speaking 6.5)
展开 IDP—雅思考试联合主办方
雅思考试总分
7.0
了解更多
雅思考试指南
- 雅思总分:7
- 托福网考总分:90
- 托福笔试总分:160
- 其他语言考试:PTE (Academic) - 63 (writing 65, speaking 65)
CRICOS代码:
申请截止日期: 请与IDP顾问联系以获取详细信息。
课程简介
当今的计算机和其他信息处理设备使用对物理定律的经典近似来操纵信息。然而
Combinatorics is the study of discrete structures and their properties. Many modern scientific advances have employed combinatorial structures to model the physical world, and recent advances in computational technology have made such investigations feasible. In particular, since computers process discrete data, combinatorics has become indispensable to computer science. Optimization, or mathematical programming, is the study of maximizing and minimizing functions subject to specified boundary conditions or constraints. With the emergence of computers, optimization experienced a dramatic growth as a mathematical theory, enhancing both combinatorics and classical analysis. The functions to be optimized arise in engineering, the physical and management sciences, and in various branches of mathematics. In the co-op option, students spend one or more terms working in industry, thus gaining valuable experience while earning their degree. Recently, the co-op option has been undertaken by students whose research focuses on financial applications of optimization. It is recommended that students interested in this option apply for the ordinary (non-co-op) MMath program and then contact the graduate officer about transferring to the co-op program subsequent to their admission.<br><br>Today's computers and other information processing devices manipulate information using what is known as the classical approximation to the laws of physics. However, we have known for some time that there is a more accurate description of the laws - the one provided by quantum mechanics. The study of how the laws of quantum mechanics affect computing, cryptography, and similar information processing tasksis known as quantum information processing. In the 1990s, a sequence of results culminated in an efficient quantum algorithm for decomposing integers into their prime factors. No efficient classical algorithm is known for this problem, and its apparent hardness for classical computers is the foundation of the RSA encryption protocol widely used for e-commerce. Since then, fast quantum algorithms have been discovered for a variety of important problems. Quantum phenomena have a dramatic, and often counter-intuitive effect on other aspects of information processing as well. For instance, they enable cryptographic tasks such as secret key expansion with the guarantee that its security rests solely on the validity of quantum theory, as opposed to the conjectured hardness of a computational problem.
展开