Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Elements of Computational Complexity
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
Quantum Chemistry
Covers quantum states, symmetries, fermions, and variational principles in quantum chemistry.
Theory of Computability: Solvability and Complexity
Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.
Theory of Computation: Decidability and Complexity
Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.
Quantum Computing: Introduction
Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.
The Quantum Fourier Transform
Covers the Quantum Fourier Transform and its application in quantum computing, explaining the process of input values computation and the concept of complex numbers.
Density Operator: Matrix to the System State
Explores density operator matrix transformation in quantum physics and the implications of measuring the system, leading to state collapse.
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
Quantum Computation: Mechanisms and Advantages of Restricted Models
Covers the mechanisms behind quantum computation and explores the advantages of restricted computational models.
Quantum Channels: Lecture 08 - Part 2
Covers the evolution of quantum systems and the dynamics of open quantum systems.
P vs NP: Complexity Theory
Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.
