All decks Close
All decks 63
  • PPIA

  • Copy of COMP3010 - 7.2 - Huffman Encoding

  • COMP3010 - 13.0 - Summary

  • COMP3010 - 12.0 - Approximation Algorithm

  • COMP3010 - 11.2 - Reduction

  • COMP3010 - 11.1 - NP-Completeness and Reduction

  • COMP3010 - 11.0 - P vs NP

  • COMP3010 - 9.2 - Randomised Algorithms

  • COMP3010 - 9.1 - Probabilistic Analysis

  • COMP3010 - 9.0 - Basic Probability

  • COMP3010 - 8.4 - Floyd-Warshall Algorithm

  • COMP3010 - 8.3 - Matrix Multiplication Method

  • COMP3010 - 8.2 - Bellman-Ford Algorithm

  • COMP3010 - 8.1 - Single-Source Shortest Path

  • COMP3010 - 8.0 - Maximum Flow

  • COMP3010 - 7.0 - LCSS

  • COMP3010 - 7.1 - Edit Distance

  • COMP3010 - 7.2 - Huffman Encoding

  • COMP3010 - 2.4 - Correctness of Iterative Algorithms

  • COMP3010 - 6.3 - Master Method

    The master method formula