(computing theory) The undesirable situation where a large number of processes waiting for an event are awoken whenever the event occurs, and then engage in a conflict over which process handles the event.

Alternative spelling of travelling salesman problem

Alternative spelling of travelling salesman problem

Alternative spelling of travelling salesman problem

A visibility problem in computational geometry, dealing with whether a number of points in a polygon can collectively "see" (by line segments akin to a person's line of sight) the whole interior of the polygon.

(graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.

(mathematics) A mathematical problem where one must determine how many grains of wheat are on a chessboard, assuming one grain of wheat is placed on the first square, and each subsequent square having twice as many grains of wheat as the previous square.

The problem of having too many options available.

(object-oriented programming) The problematic situation where a base class contains methods which mutate an object in a manner which may invalidate a (stronger) invariant found in a derived class, violating the Liskov substitution principle. For example, if a circle is modelled as a subtype of an ellipse, and the ellipse has a method that stretches it on one axis, the circle must also implement that method despite it making no sense for a circle.

Synonym of boy or girl paradox