Lectures related to Polynomial hierarchy

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.