<span class="searchmatch">decision</span> <span class="searchmatch">problems</span> plural of <span class="searchmatch">decision</span> <span class="searchmatch">problem</span>...
<span class="searchmatch">decision</span> <span class="searchmatch">problem</span> (plural <span class="searchmatch">decision</span> <span class="searchmatch">problems</span>) (computing theory) A question in some formal system with a yes-or-no answer, depending on the values of input...
decisionless <span class="searchmatch">decision</span> maker decisionmaker <span class="searchmatch">decision</span>-making <span class="searchmatch">decision</span> making <span class="searchmatch">decision</span> market <span class="searchmatch">decision</span> <span class="searchmatch">problem</span> <span class="searchmatch">decision</span> procedure <span class="searchmatch">decision</span> room <span class="searchmatch">decision</span> science...
classification of <span class="searchmatch">decision</span> <span class="searchmatch">problems</span> by the computational resources—such as time and space—needed by the programs that solve the <span class="searchmatch">problems</span>. The professor of...
(computer science, computational complexity theory) The set of all <span class="searchmatch">decision</span> <span class="searchmatch">problems</span> that are solvable by a deterministic Turing machine in exponential...
mapping reductions) (computational complexity theory) An algorithm that transforms an instance of one <span class="searchmatch">decision</span> <span class="searchmatch">problem</span> into another <span class="searchmatch">decision</span> <span class="searchmatch">problem</span>....
Semidecidable (for <span class="searchmatch">decision</span> <span class="searchmatch">problems</span>), can be approximated from either above or below by a computable function (for optimization and numerical <span class="searchmatch">problems</span>)....
times) (computer science, computational complexity theory) The class of <span class="searchmatch">decision</span> <span class="searchmatch">problems</span> solvable by a family of polynomial-sized Boolean circuits....
<span class="searchmatch">decision</span> <span class="searchmatch">problems</span> for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of <span class="searchmatch">problems</span> that...
computability theory, an operation that assigns to each <span class="searchmatch">decision</span> <span class="searchmatch">problem</span> X a successively harder <span class="searchmatch">decision</span> <span class="searchmatch">problem</span> X′ with the property that X′ is not decidable...