Lecture
Coupled Cluster: Perturbation Theory
Related lectures (32)
Quantum and Nanocomputing
Covers quantum wire analysis, transmission function, and tunneling in dots.
Pseudorandomness: Theory and Applications
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Linear Algebra Review: Vector Spaces and Matrix Operations
Offers a quick review of key linear algebra concepts essential for further topics.
Computational Complexity: Theory and Applications
Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.
Q&A Session: Written Exam Details and Electronic Structure Methods
Covers written exam details and electronic structure methods for computational chemistry.
Linear Algebra: Efficiency and Complexity
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Ramanujan Graphs: Constructions and Similarities
Explores Ramanujan graphs' constructions, matching polynomials, perfect matchings, and universal covers, along with quantitation and qualitative aspects.
Martingales: More Theory
Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.
Quantum and Nanocomputing
Explores conduction in quantum dot and discrete energy levels for nanocomputing.