- Fields of mathematics
- >
- Applied mathematics
- >
- Theoretical computer science
- >
- Mathematical theorems in theoretical computer science

- Logical consequence
- >
- Theorems
- >
- Mathematical theorems
- >
- Mathematical theorems in theoretical computer science

- Logical expressions
- >
- Theorems
- >
- Mathematical theorems
- >
- Mathematical theorems in theoretical computer science

- Mathematical concepts
- >
- Mathematical problems
- >
- Mathematical theorems
- >
- Mathematical theorems in theoretical computer science

- Mathematics
- >
- Mathematical theorems
- >
- Mathematical theorems in theoretical computer science

- Propositions
- >
- Theorems
- >
- Mathematical theorems
- >
- Mathematical theorems in theoretical computer science

Nyquist–Shannon sampling theorem

The Nyquist–Shannon sampling theorem is a theorem in the field of signal processing which serves as a fundamental bridge between continuous-time signals and discrete-time signals. It establishes a suf

Shannon's source coding theorem

In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy. Named afte

Shannon–Hartley theorem

In information theory, the Shannon–Hartley theorem tells the maximum rate at which information can be transmitted over a communications channel of a specified bandwidth in the presence of noise. It is

Cheung–Marks theorem

In information theory, the Cheung–Marks theorem, named after K. F. Cheung and Robert J. Marks II, specifies conditions where restoration of a signal by the sampling theorem can become ill-posed. It of

Schwartz–Zippel lemma

In mathematics, the Schwartz–Zippel lemma (also called the DeMillo-Lipton-Schwartz–Zippel lemma) is a tool commonly used in probabilistic polynomial identity testing, i.e. in the problem of determinin

Immerman–Szelepcsényi theorem

In computational complexity theory, the Immerman–Szelepcsényi theorem states that nondeterministic space complexity classes are closed under complementation. It was proven independently by Neil Immerm

© 2023 Useful Links.