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
Subset sum problem
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Graph Chatbot
Related lectures (4)
Login to filter by course
Login to filter by course
Reset
Complexity Classes: Introduction and Examples
Introduces complexity classes, including P and NP, and explores examples of easy and hard problems.
Gauss-Legendre Quadrature Formulas
Explores Gauss-Legendre quadrature formulas using Legendre polynomials for accurate function approximation.
Complexity Classes: P and NP
Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Untitled
Previous
Page 1 of 1
Next