Courses from 1000+ universities
Two years after its first major layoff round, Coursera announces another, impacting 10% of its workforce.
600 Free Google Certifications
Graphic Design
Data Analysis
Digital Marketing
El rol de la digitalización en la transición energética
First Step Korean
Supporting Successful Learning in Primary School
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore deterministic finite automata, their structure, and applications in computer science. Learn to construct DFAs, understand regular languages, and solve computational problems.
Explore polynomials, from formal definitions to applications in finite fields, interpolation, and error-correcting codes for noisy communication channels.
Explore approximation algorithms for NP-hard problems, focusing on vertex cover, k-coverage, and traveling salesperson. Learn greedy approaches and their limitations, as well as more advanced techniques.
Explore vector spaces, linear combinations, and applications in computer science, including Fibonacci sequences and message transmission on noisy channels.
Explore fundamental concepts in theoretical computer science, including countability, diagonalization, and set theory, with a focus on infinite sets and cardinality.
Explore Turing Machines, their definition, and programming techniques in this theoretical computer science lecture, covering interpreters, formal definitions, and practical TM subroutines.
Explore random walks and Markov chains, covering key concepts, theorems, and real-world applications like PageRank. Gain insights into probability theory and graph algorithms.
Explore key concepts in probability theory, including events, conditioning, chain rule, and independence, with practical examples and problem-solving techniques.
Explore deductive systems in theoretical computer science, covering topics like Hilbert's 10th problem, binary trees, propositional logic, and logical equivalence.
Explore finite automata and regular languages in theoretical computer science, covering DFAs, computation concepts, and language analysis techniques.
Learn about time complexity in algorithms, covering input sizes, running time analysis, worst-case scenarios, and efficiency considerations for various computational problems.
Explore theoretical computer science through polynomials, covering fields, division, evaluation, interpolation, and error-correcting codes. Gain insights into fundamental concepts and their applications.
Explore computability theory, Turing machines, and undecidable problems in this theoretical computer science lecture, focusing on fundamental concepts and their implications.
Explore theoretical computer science concepts, focusing on proofs: their history, significance, and modern developments. Learn tips for constructing proofs and avoiding common mistakes in mathematical reasoning.
Explore fundamental concepts of graph theory, including definitions, basic questions, regular graphs, and perfect matching. Gain insights into connecting graphs and equivalence relations.
Get personalized course recommendations, track subjects and courses with reminders, and more.