Faster access than browser!
24 relations: Augustin-Louis Cauchy, Bernard Bolzano, Colombeau algebra, Computational complexity theory, Computationally bounded adversary, Concrete security, Continuous function, Converse (logic), Cryptographically secure pseudorandom number generator, Cryptography, Eduard Heine, Function (mathematics), Gottfried Wilhelm Leibniz, Gromov's theorem on groups of polynomial growth, Infinitesimal, Isaac Newton, Karl Weierstrass, Mathematical analysis, Negligible set, Non-standard analysis, Non-standard calculus, One-way function, Positive polynomial, Provable security.
Augustin-Louis Cauchy
Baron Augustin-Louis Cauchy FRS FRSE (21 August 178923 May 1857) was a French mathematician, engineer and physicist who made pioneering contributions to several branches of mathematics, including: mathematical analysis and continuum mechanics.
New!!: Negligible function and Augustin-Louis Cauchy · See more »
Bernard Bolzano
Bernard Bolzano (born Bernardus Placidus Johann Nepomuk Bolzano; 5 October 1781 – 18 December 1848) was a Bohemian mathematician, logician, philosopher, theologian and Catholic priest of Italian extraction, also known for his antimilitarist views.
New!!: Negligible function and Bernard Bolzano · See more »
Colombeau algebra
In mathematics, a Colombeau algebra is an algebra of a certain kind containing the space of Schwartz distributions.
New!!: Negligible function and Colombeau algebra · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: Negligible function and Computational complexity theory · See more »
Computationally bounded adversary
In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel.
New!!: Negligible function and Computationally bounded adversary · See more »
Concrete security
In cryptography, concrete security or exact security is a practice-oriented approach that aims to give more precise estimates of the computational complexities of adversarial tasks than polynomial equivalence would allow.
New!!: Negligible function and Concrete security · See more »
Continuous function
In mathematics, a continuous function is a function for which sufficiently small changes in the input result in arbitrarily small changes in the output.
New!!: Negligible function and Continuous function · See more »
Converse (logic)
In logic, the converse of a categorical or implicational statement is the result of reversing its two parts.
New!!: Negligible function and Converse (logic) · See more »
Cryptographically secure pseudorandom number generator
A cryptographically secure pseudo-random number generator (CSPRNG) or cryptographic pseudo-random number generator (CPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography.
New!!: Negligible function and Cryptographically secure pseudorandom number generator · See more »
Cryptography
Cryptography or cryptology (from κρυπτός|translit.
New!!: Negligible function and Cryptography · See more »
Eduard Heine
Heinrich Eduard Heine (16 March 1821, Berlin – October 1881, Halle) was a German mathematician.
New!!: Negligible function and Eduard Heine · See more »
Function (mathematics)
In mathematics, a function was originally the idealization of how a varying quantity depends on another quantity.
New!!: Negligible function and Function (mathematics) · See more »
Gottfried Wilhelm Leibniz
Gottfried Wilhelm (von) Leibniz (or; Leibnitz; – 14 November 1716) was a German polymath and philosopher who occupies a prominent place in the history of mathematics and the history of philosophy.
New!!: Negligible function and Gottfried Wilhelm Leibniz · See more »
Gromov's theorem on groups of polynomial growth
In geometric group theory, Gromov's theorem on groups of polynomial growth, first proved by Mikhail Gromov, characterizes finitely generated groups of polynomial growth, as those groups which have nilpotent subgroups of finite index.
New!!: Negligible function and Gromov's theorem on groups of polynomial growth · See more »
Infinitesimal
In mathematics, infinitesimals are things so small that there is no way to measure them.
New!!: Negligible function and Infinitesimal · See more »
Isaac Newton
Sir Isaac Newton (25 December 1642 – 20 March 1726/27) was an English mathematician, astronomer, theologian, author and physicist (described in his own day as a "natural philosopher") who is widely recognised as one of the most influential scientists of all time, and a key figure in the scientific revolution.
New!!: Negligible function and Isaac Newton · See more »
Karl Weierstrass
Karl Theodor Wilhelm Weierstrass (Weierstraß; 31 October 1815 – 19 February 1897) was a German mathematician often cited as the "father of modern analysis".
New!!: Negligible function and Karl Weierstrass · See more »
Mathematical analysis
Mathematical analysis is the branch of mathematics dealing with limits and related theories, such as differentiation, integration, measure, infinite series, and analytic functions.
New!!: Negligible function and Mathematical analysis · See more »
Negligible set
In mathematics, a negligible set is a set that is small enough that it can be ignored for some purpose.
New!!: Negligible function and Negligible set · See more »
Non-standard analysis
The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers.
New!!: Negligible function and Non-standard analysis · See more »
Non-standard calculus
In mathematics, non-standard calculus is the modern application of infinitesimals, in the sense of non-standard analysis, to differential and integral calculus.
New!!: Negligible function and Non-standard calculus · See more »
One-way function
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input.
New!!: Negligible function and One-way function · See more »
Positive polynomial
In mathematics, a positive polynomial on a particular set is a polynomial whose values are positive on that set.
New!!: Negligible function and Positive polynomial · See more »
Provable security
Provable security refers to any type or level of security that can be proved.
New!!: Negligible function and Provable security · See more »
Redirects here:
Negligibility, Negligible (complexity theory), Negligible (complexitytheory), Negligible (mathematics), Negligible function (cryptography).
References
[1] https://en.wikipedia.org/wiki/Negligible_function
