Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
From Algorithms to Architectures: Isomorphic Mapping and Efficiency Assessment
Graph Chatbot
Related lectures (39)
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Theory of Computation: Monotone Complexity and XOR-SAT Lower Bounds
Explores monotone complexity, XOR-SAT lower bounds, and their implications in computational theory.
Untitled
Theory of Computability: Solvability and Complexity
Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Elements of Computational Complexity
Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Coin Rendering: Part 1
MOOC: Information, Computation, Communication: Introduction to computational thinking
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Optimal Power Flow Solvers: Next Generation Advancements
Explores advancements in optimal power flow solvers, focusing on multiperiod and security-constrained optimization.
Recursive Enumerability: Turing Machines and Undecidable Languages
Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.
Complexity of Algorithms
Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.
Simulating Molecular Biology: Challenges and Opportunities
Explores simulating molecular biology dynamics, addressing challenges and opportunities in computational research.
Linear Systems: Convergence and Methods
Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.
Elements of computational complexity
Log in to Mediaspace to watch this video
Covers classical and quantum computational complexity concepts and implications.
Shor Algorithm: Quantum Factorization
Log in to Mediaspace to watch this video
Covers the Shor algorithm for quantum factorization using tensor methods and graded solutions.
Shor Algorithm: Circuit Details
Log in to Mediaspace to watch this video
Covers the details of the Shor algorithm circuit and its complexity.
Deutsch and Josza Problem
Log in to Mediaspace to watch this video
Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.
Simon Problem 4: Quantum State and Complexity Analysis
Log in to Mediaspace to watch this video
Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.
Subquadratic Attention Mechanisms: State Space Models Overview
Log in to Mediaspace to watch this video
Covers subquadratic attention mechanisms and state space models, focusing on their theoretical foundations and practical implementations in machine learning.
Theory of Computation: Countability and Undecidable Problems
Log in to Mediaspace to watch this video
Explores countability and undecidable problems in the theory of computation.
State Space Models: Expressivity of Transformers
Log in to Mediaspace to watch this video
Covers state space models and the expressivity of transformers in sequence copying tasks.
Previous
Page 1 of 2
Next