discrete log problem
1Log-lineare Modelle — gehören zu den multivariaten Verfahren. Mit Log linearen Modellen werden nominalskalierte Daten analysiert. Durch eine logarithmische Transformation kann man bei der Analyse mehrdimensionaler Häufigkeitstabellen das Problem meist anschaulicher… …
2Log-lineares Modell — Log lineare Modelle gehören zu den multivariaten Verfahren. Mit Log linearen Modellen werden nominalskalierte Daten analysiert. Durch eine logarithmische Transformation kann man bei der Analyse mehrdimensionaler Häufigkeitstabellen das Problem… …
3Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …
4Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …
5Discrete sine transform — In mathematics, the discrete sine transform (DST) is a Fourier related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length,… …
6Problem der Museumswächter — Das Problem der Museumswächter (en: Art gallery problem) ist eine Fragestellung der Algorithmischen Geometrie. Dabei wird folgende Situation untersucht: „Gegeben sei eine polygonale Fläche G mit Rand , interpretiert als Grundriss eines Museums.… …
7P versus NP problem — Unsolved problems in computer science Is P = NP ? …
8Diffie-Hellman problem — The Diffie Hellman problem (DHP) is the name of a specific problem in cryptography which was first proposed by Whitfield Diffie and Martin Hellman. The DHP is a problem that is assumed to be difficult to do, hence the security of many… …
9Diffie–Hellman problem — Cryptography portal The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical… …
10Uniform distribution (discrete) — discrete uniform Probability mass function n = 5 where n = b − a + 1 Cumulative distribution function …
