may be a problem
121Dynamic problem (algorithms) — Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in this category is usually stated as follows: Given a class of input objects, find efficient… …
122Numerical sign problem — The numerical sign problem refers to the difficulty of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near cancellation of the positive and negative… …
123Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… …
124Year 10,000 problem — The Year 10,000 problem, or Y10K, is the class of all potential software bugs that may emerge should the need to express years with five digits arise. The problem can have discernible effects today, but is also sometimes mentioned because of its… …
125Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… …
126Year 2007 problem — The Year 2007 problem also known as Y2K7 (or DST07) is an issue caused by a US mandated change to daylight saving time, which has repercussions in the computer industry.cite web | date = 2007 01 29 | accessdate = 2007 03 01 | title = Daylight… …
127Whitehead problem — In group theory, a branch of abstract algebra, the Whitehead problem is the following question::Is every abelian group A with Ext1( A , Z) = 0 a free abelian group?Abelian groups satisfying this condition are sometimes called Whitehead groups, so …
128Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… …
