Examples of using Computational problem in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
A general computational problem may have numerical parameters.
Apply mathematical andscientific reasoning to a variety of computational problems.
Computational problems of this type are called promise problems. .
Work effectively in teams to design andimplement solutions to computational problems.
In this computational problem we're given as input two numbers.
Design, correctly implement anddocument solutions to significant computational problems.
This is a hard computational problem, for which several approximate solutions have been devised.
Calculating the number of self-avoiding walks in any given lattice is a common computational problem.
Therefore, they can be limited by computational problems in case of a complex evidence network.
Computational problems are one of the main objects of study in theoretical computer science.
This notion is useful because it reduces computational problems to graph reachability problems. .
The computational problem of determining whether two finite graphs are isomorphic is called the graph isomorphism problem. .
The integer factorization problem is the computational problem of determining the prime factorization of a given integer.
For example, the problem of factoring"Given a positive integer n,find a nontrivial prime factor of n." is a computational problem.
However, some computational problems are easier to analyze in terms of more unusual resources.
In computational complexity theory and computability theory,a search problem is a type of computational problem represented by a binary relation.
When considering computational problems, a problem instance is a string over an alphabet.
In computational complexity theory, it is usually implicitly assumed that any string in{0,1}* represents an instance of the computational problem in question.
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.
It represents the amount of time(or number of computation steps)that a"normal" physical computer would take to solve a certain computational problem using a certain algorithm.
A decision problem is a special type of computational problem whose answer is either yes or no, or alternately either 1 or 0.
An individual computational problem is thus associated with a particular"family" of Boolean circuits formula_21 where each formula_15 is the circuit handling inputs of"n" bits.
You have the ambition to get to the core of a scientific computational problem and are eager to discuss this at the highest level with your peers.
An individual computational problem is thus associated with a particular family of Boolean circuits C 1, C 2,…{\displaystyle C_{1}, C_{2},\dots} where each C n{\displaystyle C_{n}} is the circuit handling inputs of n bits.
Measuring the size of an instance===To measure the difficulty of solving a computational problem, one may wish to see how much time the best algorithm requires to solve the problem. .
The input string for a computational problem is referred to as a problem instance, and should not be confused with the problem itself.
In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input strings.
To measure the difficulty of solving a computational problem, one may wish to see how much time the best algorithm requires to solve the problem. .
Now you probably weren't thinking in these terms at the time, butmultiplying two numbers is certainly a well defined computational problem, and that procedure you learned back in 3rd grade or so is indeed an algorithm. So let's just make that a little bit more precise.
When we use the logic formalism to describe a computational problem, the input is a finite structure, and the elements of that structure are the domain of discourse.