2.9. Symbolic and Discrete Computation (SDC)

2.9. Symbolic and Discrete Computation (SDC)

This area bridges classical mathematical disciplines with computational methods, focusing on symbolic computation, algebraic algorithms, number theory applications, and computational logic. It covers the manipulation of mathematical expressions in exact form, the computational aspects of discrete mathematics, and the application of these techniques to cryptography and formal verification. This knowledge is essential for developing computer algebra systems, cryptographic protocols, and formally verified software.

Table 2.9: List of KUs in the Symbolic and Discrete Computation area.

2.9.1. SDC/Group Theory and Algebraic Algorithms  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Group theory fundamentals and computational representation
  • Algebraic algorithms for group operations
  • Permutation groups and computational symmetry
  • Applications in cryptography and coding theory
  • Complexity of algebraic algorithms

Learning Outcomes:
Core:

  1. Implement fundamental group operations computationally [Usage]
  2. Analyze algebraic algorithms for group theory [Assessment]
  3. Apply permutation groups to symmetry problems [Usage]
  4. Use group theory in cryptographic applications [Usage]

2.9.2. SDC/Computational Number Theory and Cryptography  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Modular arithmetic and algorithms
  • Primality testing and factorization
  • Elliptic curve cryptography
  • Discrete logarithm problem
  • Post-quantum cryptography foundations

Learning Outcomes:
Core:

  1. Implement modular arithmetic algorithms [Usage]
  2. Apply primality testing methods [Usage]
  3. Use elliptic curves in cryptographic protocols [Usage]
  4. Analyze discrete logarithm based systems [Assessment]

2.9.3. SDC/Symbolic Computation Systems  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Computer algebra systems (Mathematica, SymPy)
  • Symbolic integration and differentiation
  • Equation solving and simplification
  • Theorem proving and automated reasoning
  • Applications in scientific computing

Learning Outcomes:
Core:

  1. Use computer algebra systems for mathematical computation [Usage]
  2. Implement symbolic computation algorithms [Usage]
  3. Apply theorem proving techniques [Usage]
  4. Connect symbolic and numerical computation [Assessment]

2.9.4. SDC/Computational Logic and Formal Verification  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Propositional and predicate logic
  • SAT solvers and satisfiability
  • Model checking and temporal logic
  • Program verification and Hoare logic
  • Interactive theorem provers

Learning Outcomes:
Core:

  1. Apply computational logic to problem solving [Usage]
  2. Use SAT solvers for constraint satisfaction [Usage]
  3. Implement model checking algorithms [Usage]
  4. Verify programs using formal methods [Usage]

Spotted a typo, an outdated course, a broken link, or have a suggestion? Let us know.

Scan to open on your phone