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
Concept
Descriptive complexity theory
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Graph Chatbot
Related lectures (12)
Login to filter by course
Login to filter by course
Reset
MHD Equilibrium & Stability
Explores Magnetohydrodynamic equilibrium and stability, ideal MHD solutions, 'hairy ball' theorem, and boundary conditions.
Search Algorithms: Dichotomy Search
Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.
Quantifier Elimination Steps for Presburger Arithmetic
Explores quantifier elimination steps for Presburger Arithmetic, emphasizing techniques to simplify and eliminate quantifiers efficiently.
Search Algorithms: Linear vs Logarithmic
Illustrates the efficiency of logarithmic search algorithms over linear ones, emphasizing the importance of data modeling and the trade-off between sorting and searching costs.
Theory of Computation: Conclusions and Complexity Theory
Explores decision-making problems, complexity theory, and the NP vs P classes.
Information Retrieval: Indexing and Retrieval
Covers indexing techniques, distributed retrieval algorithms, and challenges in large-scale web indexing.
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
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.
Theory of Computation: NP Complexity
Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.
Theory of Computation: Complexity of Problems
Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.
Theory of Computation: Monotone Complexity and XOR-SAT Lower Bounds
Explores monotone complexity, XOR-SAT lower bounds, and their implications in computational theory.
Distributed Information Retrieval
Explores centralized and distributed information retrieval, including Fagin's Algorithm for efficient document identification.
Previous
Page 1 of 1
Next
