dict.cc

⇄

⇄

Advertisement

NOUN | a problem | problems | |

SYNO | job | problem | trouble |

problem {noun} | πρόβλημα {το} | ||

No problem! <np> | Δεν υπάρχει πρόβλημα! |

Advertisement

Usage Examples English

- The popular algorithms textbook "Algorithm Design" provides a related
**problem**-description and an approximation algorithm. - The Behavior Window is a visual diagram used to determine who owns the
**problem**when one occurs in a relationship. - The discrete logarithm
**problem**, the quadratic residuosity problem, the RSA inversion problem, and the problem of computing the permanent of a matrix are each random self-reducible problems. - In computer science, the exact cover
**problem**is a decision problem to determine if an exact cover exists. - This
**problem**is also known as the Cheating Husbands Problem, the Unfaithful Wives Problem, the Muddy Children Problem. It is logically identical to the Blue Eyes Problem.

- Different terms have been used for
**problem**finding in literature including problem discovery, problem formulation, problem identification, problem construction, and problem posing. - Bayes' rule and computing conditional probabilities provide a solution method for a number of popular puzzles, such as the Three Prisoners
**problem**, the Monty Hall problem, the Two Child problem and the Two Envelopes problem. - In operations research, the cutting-stock
**problem**is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted. - The emptiness
**problem**, the universality problem and the containability problem for OCATA is decidable but is a nonelementary problem. - He stated in 1914 the so-called word
**problem**for semigroups or Thue problem, closely related to the halting problem.

- The
**problem**of reconstructing a multidimensional signal from its projection is uniquely multidimensional, having no 1-D counterpart. - Intuitively,
**problem**A is reducible to problem B via an approximation-preserving reduction if, given an instance of problem A and a (possibly approximate) solver for problem B, one can convert the instance of problem A into an instance of problem B, apply the solver for problem B, and recover a solution for problem A that also has some guarantee of approximation. - 2000 - Anthony Chen formulated the traffic equilibrium
**problem**as an unconstrained optimization problem that is equivalent to the nonlinear complementarity problem. - The most interesting open
**problem**in computational complexity theory is the P vs. - By carefully writing the above equations as matrix equations, we obtain its dual
**problem**: [...] and by the duality theorem of linear programming, since the primal problem is feasible and bounded, so is the dual problem, and the minimum in the first problem equals the maximum in the second problem.

Advertisement