- straightforward enumeration
- мат. прямой перебор (вариантов)
Большой англо-русский и русско-английский словарь. 2001.
straightforward enumeration
Смотреть что такое "straightforward enumeration" в других словарях:
systems engineering — ☆ systems engineering n. a branch of engineering using esp. information theory, computer science, and facts from systems analysis studies to design integrated operational systems for specific complexes systems engineer n. * * * Technique of using … Universalium
NSA warrantless surveillance controversy — For the related controversy about data mining of domestic call records see NSA call database. National Security Agency logo The NSA warrantless surveillance controversy (AKA Warrantless Wiretapping ) concerns surveillance of persons within the… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Comparison of Pascal and C — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
Sacraments — • Presents the necessity, the nature, the origin and cause, the number, the effects, the minister, and the recipient of the Sacraments Catholic Encyclopedia. Kevin Knight. 2006. Sacraments Sacraments … Catholic encyclopedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … 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
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Lutheranism — Luther s Seal Book of Concord … Wikipedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
