Lectures related to Polynomial hierarchy

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.

Class hierarchies: pattern matching

Covers class hierarchies, pattern matching, function values, and function calls in Scala.

Computational Complexity: Theory and Applications

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Cryptanalysis: Public-Key & The Power of Interaction

Explores cryptanalysis in public-key systems and the power of interaction in interactive proofs, covering CO-NP, NP classes, P vs. NP, and more.

Elements of Computational Complexity

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Decomposition: Evaluation and New Forms

Explores decomposition in programming through evaluating expressions and adding new forms, emphasizing object-oriented solutions and the trade-offs involved.

Correctness and Soundness of the Qubit Test

Explores the correctness and soundness of the Qubit Test, emphasizing probabilistic algorithms, trapdoors, and function inversion.

Theory of Computation: Decidability and Complexity

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Density Operator Formalism

Covers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.

Complexity Classes: P and NP

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Lenstra's Algorithm: Integer Factorization

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

Theory of Computability: Solvability and Complexity

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Theory of Computation: Complexity of Problems

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Complexity of Algorithms: Quiz + Answers

Covers the time complexity of algorithms and includes a quiz.

Digital Controller Design: Pole Placement Technique

Covers digital controller design, focusing on discrete-time models and the pole placement technique.

Systems Engineering: Requirements, Architecture, and Standards

Explores the history, definitions, and challenges of Systems Engineering, emphasizing the importance of requirements in system design and architecture.