Lectures related to P/poly | EPFL Graph Search

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Covers classical and quantum computational complexity concepts and implications.

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

Covers the consensus problem in distributed computing, focusing on uniform consensus properties and algorithms.