Search results
Results from the WOW.Com Content Network
NC = P problem The P vs NP problem is a major unsolved question in computer science that asks whether every problem whose solution can be quickly verified by a computer (NP) can also be quickly solved by a computer (P). This question has profound implications for fields such as cryptography, algorithm design, and computational theory.
Pages in category "Unsolved problems in computer science" The following 33 pages are in this category, out of 33 total. This list may not reflect recent changes .
The problem of determining if a given set of Wang tiles can tile the plane. The problem of determining the Kolmogorov complexity of a string. Hilbert's tenth problem: the problem of deciding whether a Diophantine equation (multivariable polynomial equation) has a solution in integers.
A decision problem is a question which, for every input in some infinite set of inputs, requires a "yes" or "no" answer. [2] Those inputs can be numbers (for example, the decision problem "is the input a prime number?") or values of some other kind, such as strings of a formal language.
In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring "Given a positive integer n, find a nontrivial prime factor of n." is a computational problem that has a solution, as there are many known integer factorization algorithms.
In other words, a problem with input size n is in NC if there exist constants c and k such that it can be solved in time O((log n) c) using O(n k) parallel processors. Stephen Cook [1] [2] coined the name "Nick's class" after Nick Pippenger, who had done extensive research [3] on circuits with polylogarithmic depth and polynomial size. [4]
In computer architecture, a trace cache or execution trace cache is a specialized instruction cache which stores the dynamic stream of instructions known as trace. It helps in increasing the instruction fetch bandwidth and decreasing power consumption (in the case of Intel Pentium 4 ) by storing traces of instructions that have already been ...
In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed. [ 1 ] The predecessor problem is a simple case of the nearest neighbor problem, and data structures that solve it have applications in problems like integer sorting .