- equivalence problem
- мат. проблема эквивалентности
Большой англо-русский и русско-английский словарь. 2001.
equivalence problem
Смотреть что такое "equivalence problem" в других словарях:
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Cartan's equivalence method — In mathematics, Cartan s equivalence method is a technique in differential geometry for determining whether two geometrical structures are the same up to a diffeomorphism. For example, if M and N are two Riemannian manifolds with metrics g and h … Wikipedia
Formal equivalence checking — process is a part of electronic design automation (EDA), commonly used during the development of digital integrated circuits, to formally prove that two representations of a circuit design exhibit exactly the same behavior. Equivalence checking… … Wikipedia
Mass–energy equivalence — E=MC2 redirects here. For other uses, see E=MC2 (disambiguation). 4 meter tall sculpture of Einstein s 1905 E = mc2 formula at the 2006 Walk of Ideas, Berlin, Germany In physics, mass–energy equivalence is the concept that the … Wikipedia
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
Kepler problem in general relativity — The Kepler problem in general relativity involves solving for the motion of two spherical bodies interacting with one another by gravitation, as described by the theory of general relativity.Typically, and in this article, one body is assumed to… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Convergence problem — In the analytic theory of continued fractions, the convergence problem is the determination of conditions on the partial numerators ai and partial denominators bi that are sufficient to guarantee the convergence of the continued fraction This… … Wikipedia
Word problem (mathematics) — In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements, is the algorithmic problem of deciding whether two given representatives represent the same element of the set.… … 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
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
