Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Polynomial-time reduction

Related lectures (28)

Linear Algebra in 2D: Reduction Applications

Explores the application of reductions in R² for linear functions, emphasizing the calculation of f composed n times with itself.

Complex Systems: Critical Phenomena

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Computational Complexity: Theory and Applications

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

Designing Systems for Harsh Environments: Principles and Strategies

Covers design principles for mechanical systems in radiative and dusty environments.

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.

Cryptographic Primitives: Theory and Practice

Explores fundamental cryptographic primitives, security models, and the relationship between decryption security and key recovery security.

Correctness and Soundness of the Qubit Test

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

Density Operator Formalism

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

Promise Constraint Satisfaction and Width

Covers Promise Constraint Satisfaction Problems complexity, width, graph coloring, polymorphisms, and algorithms.

Global Sensitivity Analysis in Stochastic Systems

On Variance-Based Sensitivity Analysis for Stochastic Systems covers the impact of parameters uncertainty and sensitivity indices in stochastic models.

Elements of Computational Complexity

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

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.

Cartesian Equations: Lines in Space

Covers the Cartesian equations of lines in space and their directional properties.

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 Classes: P and NP

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

Knapsack Problem: Optimization and Traveling Salesman

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Cryptographic Security Fundamentals

Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.

Chemical Transformations in (Photo) Electrocatalytic Materials

Explores chemical transformations in (photo) electrocatalytic materials, including interface engineering, CO₂ reduction, and advanced characterization techniques.

Untitled