Concept
Graph isomorphism problem
Related lectures (31)
Integer Factorization: Quadratic Sieve
Covers the Quadratic Sieve method for integer factorization, emphasizing the importance of choosing the right parameters for efficient factorization.
Networked Control Systems: Convergence Rate and Digraphs
Explores convergence rate in networked control systems and consensus in digraphs, emphasizing the challenges of computing Pess(A) and weight assignment.
Groups and Numbers: Hidden Subgroup Problem
Explores groups and numbers, emphasizing the hidden subgroup problem and its complexities in classic and quantum algorithms.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Hidden Sub-group Problem and Simon Algorithm
Explores the hidden sub-group problem and Simon algorithm in quantum computing.
Deep Learning Building Blocks
Covers the fundamental building blocks of deep learning, including tensors, backpropagation, and PyTorch.
Introduction: Course syllabus
Introduces the course syllabus, grading scheme, and classical and quantum computation models.
Mobile Telephony Security
Explores the security challenges and improvements in mobile telephony, covering encryption algorithms, protocols, and integrity/authentication issues.
Pseudorandomness: Expander Mixing Lemma
Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.
Max-Flow Min-Cut
Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.