Concept
Pseudo-polynomial time
Related lectures (30)
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Cryptographic Primitives: Theory and Practice
Explores fundamental cryptographic primitives, security models, and the relationship between decryption security and key recovery security.
RSA Cryptography: Primality Testing and Quadratic Residues
Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.
Introduction to Numerical Analysis
Covers the basics of numerical analysis, including adaptive feature computation, residual analysis, and the importance of well-posed problems.
Independence Polynomial of Dependency Graph
Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.
Complexity Classes: Introduction and ExamplesMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Introduces complexity classes, including P and NP, and explores examples of easy and hard problems.