mathematics, exponential polynomials are functions on fields, rings, or abelian groups that take the form of polynomials in a variable and an exponential function...

faster than any polynomial but is still significantly smaller than an exponential. In this sense, problems that have sub-exponential time algorithms are...

substituted for an exponential function applied to the first variable, for example P(x, ex), may be called an exponential polynomial. A rational fraction...

Exponential object (category theory) Exponential polynomials—see also Touchard polynomials (combinatorics) Exponential response formula Exponential sheaf...

machine in exponential time, i.e., in O(2p(n)) time, where p(n) is a polynomial function of n. EXPTIME is one intuitive class in an exponential hierarchy...

task and runs in polynomial time (as opposed to, say, exponential time), meaning the task completion time is bounded above by a polynomial function on the...

Exponential growth occurs when a quantity grows as an exponential function of time. The quantity grows at a rate directly proportional to its present...

for polynomial time algorithms. In general, the numeric value of the input is exponential in the input length, which is why a pseudo-polynomial time...

computer science In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is...

polynomial time. However, unless P=NP, any polynomial-time algorithm must asymptotically be wrong on more than polynomially many of the exponentially...

series for all x in the complex plane, it is called entire. The polynomials, exponential function ex, and the trigonometric functions sine and cosine, are...

In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. It is used to solve systems...

a polynomial time algorithm, the AKS primality test. In some cases, quasi-polynomial time bounds can be proven to be optimal under the exponential time...

and complex analysis (3rd ed.), New York: McGraw-Hill, ISBN 978-0-07-054234-1, MR 0924157. Trigonometric series Quasi-polynomial Exponential polynomial...

factorization be done in polynomial time on a classical (non-quantum) computer? Can the discrete logarithm be computed in polynomial time on a classical (non-quantum)...

mathematics, an exponential sum may be a finite Fourier series (i.e. a trigonometric polynomial), or other finite sum formed using the exponential function,...

Ehrhart polynomial Exponential polynomials Favard's theorem Fibonacci polynomials Gegenbauer polynomials Hahn polynomials Hall–Littlewood polynomials Heat...

complexity theory, the exponential hierarchy is a hierarchy of complexity classes that is an exponential time analogue of the polynomial hierarchy. As elsewhere...

In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that...

the exponential function is the unique real function which maps zero to one and has a derivative everywhere equal to its value. The exponential of a...

The Chebyshev polynomials are two sequences of orthogonal polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)}...

Lagrange polynomials Fitting using parameterised curves (such as splines, the Nelson-Siegel family, the Svensson family, the exponential polynomial family...

In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The...

used for defining closed forms are commonly logarithms, exponential function and polynomial roots. Functions that have a closed form for these basic...

In mathematics, the exponential integral Ei is a special function on the complex plane. It is defined as one particular definite integral of the ratio...

distinction between an algorithm that ran in polynomial time versus one that ran in (moderately) exponential time. Manindra Agrawal, Neeraj Kayal, Nitin...

thus exponential rather than polynomial in the space used to represent the input. Hence, it is not possible to carry out this computation in polynomial time...

be NP-complete, the exponential time hypothesis implies that these problems are non-polynomial. More generally, the exponential time hypothesis implies...

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, for which only...

nc for a constant c is exponential in log n. The running time of the number field sieve is super-polynomial but sub-exponential in the size of the input...