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

Lecture

Untitled

Official source

https://switch-video-production.os.zhdk.cloud.switch.ch/transcoding/ac/a3/ab8d78f5802df609e79c3e97273b/h264-1080p.mp4?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=c70ce910fb73491f9933421af7a4fcee%2F20240725%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20240725T144714Z&X-Amz-Expires=86400&X-Amz-SignedHeaders=host&X-Amz-Signature=9acf097832c5206517cf9464f8d7803124da906ac1e951bcc691d2622597245b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (18)

NP-completeness

In computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) solution. The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions.

P-complete

In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction. The notion of P-complete decision problems is useful in the analysis of: which problems are difficult to parallelize effectively, which problems are difficult to solve in limited space. specifically when stronger notions of reducibility than polytime-reducibility are considered.

Complete lattice

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.

Category of modules

In algebra, given a ring R, the category of left modules over R is the whose are all left modules over R and whose morphisms are all module homomorphisms between left R-modules. For example, when R is the ring of integers Z, it is the same thing as the . The category of right modules is defined in a similar way. One can also define the category of bimodules over a ring R but that category is equivalent to the category of left (or right) modules over the enveloping algebra of R (or over the opposite of that).

Roof

A roof (: roofs or rooves) is the top covering of a building, including all materials and constructions necessary to support it on the walls of the building or on uprights, providing protection against rain, snow, sunlight, extremes of temperature, and wind. A roof is part of the building envelope. The characteristics of a roof are dependent upon the purpose of the building that it covers, the available roofing materials and the local traditions of construction and wider concepts of architectural design and practice, and may also be governed by local or national legislation.

Related lectures (1)

Homotopy theory of chain complexes