Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est optimal polynomial - définition
CLASS OF MATHEMATICAL PROBLEMS CONCERNED WITH CHOOSING AN OPTIMAL TIME TO TAKE A PARTICULAR ACTION
Optimal Stopping; Optimal Stopping problem
HOMFLY polynomial
TWO-VARIABLE KNOT POLYNOMIAL, GENERALIZING THE JONES AND ALEXANDER POLYNOMIALS
HOMFLY(PT) polynomial; HOMFLY; LYMPHTOFU polynomial; HOMFLYPT polynomial; Homfly polynomial; FLYPMOTH polynomial; HOMFLY invariant
In the mathematical field of knot theory, the HOMFLY polynomial or HOMFLYPT polynomial, sometimes called the generalized Jones polynomial, is a 2-variable knot polynomial, i.e.
Polynomial transformation
TRANSFORMATION OF A POLYNOMIAL INDUCED BY A TRANSFORMATION OF ITS ROOTS
Transforming Polynomials; Transforming polynomials; Polynomial transformations; Depressed polynomial
In mathematics, a polynomial transformation consists of computing the polynomial whose roots are a given function of the roots of a polynomial. Polynomial transformations such as Tschirnhaus transformations are often used to simplify the solution of algebraic equations.
Polynomial hierarchy
![PH]], and [[PSPACE]]](https://commons.wikimedia.org/wiki/Special:FilePath/Complexity-classes-polynomial.svg?width=200 "PH]], and [[PSPACE]]")
HIERARCHY OF COMPLEXITY CLASSES BETWEEN P AND PSPACE
Polynomial time hierarchy; Polynomial-time hierarchy; NP^NP; Sigma2p
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes NP and co-NP.Arora and Barak, 2009, pp.
Wikipédia
Optimal stopping
In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.
