-
1 задача факторизации целых чисел
Cryptography: integer factorization problemУниверсальный русско-английский словарь > задача факторизации целых чисел
-
2 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
См. также в других словарях:
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
Factorization lemma — In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect T . An application of this is regression analysis.TheoremLet T:Omega ightarrowOmega be a function of a set Omega… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Function problem — In computational complexity theory, a function problem is a problem other than a decision problem, that is, a problem requiring a more complex answer than just YES or NO.Notable examples include the travelling salesman problem, which asks for the … Wikipedia
Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… … Wikipedia
Higher residuosity problem — In cryptography most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem is one such problem. This problem is easier to solve than integer factorization, so the assumption that this … Wikipedia
RSA problem — In cryptography, the RSA problem is the task of finding e th roots modulo a composite number N whose factors are not known. In other words, the problem is to perform the RSA private key operation given only the public key. A fast means of solving … Wikipedia
Hilbert's twenty-first problem — For Riemann Hilbert factorization problems on the complex plane see Riemann Hilbert. The twenty first problem of the 23 Hilbert problems, from the celebrated list put forth in 1900 by David Hilbert, was phrased like this (English translation from … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
