- equivalent problem
- мат. эквивалентная задача
Большой англо-русский и русско-английский словарь. 2001.
equivalent problem
Смотреть что такое "equivalent problem" в других словарях:
Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… … Wikipedia
NP-equivalent — In computational complexity theory, the complexity class NP equivalent is the set of function problems that are both NP easy and NP hard.[1] NP equivalent is the analogue of NP complete for function problems. For example, the problem FIND SUBSET… … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … 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
Gauss circle problem — In mathematics, the Gauss circle problem is the problem of determining how many lattice points there are in a circle centred at the origin and with radius r . The first progress on a solution was made by Carl Friedrich Gauss, hence its name.The… … Wikipedia
Thirty-six officers problem — The thirty six officers problem is a mathematical puzzle proposed by Leonhard Euler in 1782. [Euler, L., Recherches sur une nouvelle espece de quarres magiques (1782).] [cite journal | url = http://books.google.com/books?id=cuudxJgEnyEC pg=PA54… … Wikipedia
Steiner's problem — is the problem of finding the maximum of the function: f(x)=x^{1/x}.,It is named after Jakob Steiner.The maximum is at x=e, where e denotes the base of natural logarithms. One can determine that by solving the equivalent problem of maximizing :… … Wikipedia
Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… … Wikipedia
Classical central-force problem — In classical mechanics, the central force problem is to determine the motion of a particle under the influence of a single central force. A central force is a force that points from the particle directly towards (or directly away from) a fixed… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
