Examples of using Computational complexity in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
Theory of computational complexity.
Other variants of this model allow more computational complexity.
Computational complexity and extremal combinatorics.
It belongs to the class NP of computational complexity.
Related content Computational complexity and extremal combinatorics.
People also translate
The Valiant-Vazirani theorem is a theorem in computational complexity theory.
However, its computational complexity and efficiency are still not ideal.
I once published a paper about computational complexity on arXiv.
In computational complexity theory, it is a combinatorial NP-hard problem.
This reduction does not respect computational complexity, however.
In computational complexity theory, generalized geography is a well-known PSPACE-complete problem.
The W hierarchy is a collection of computational complexity classes.
We get the final computational complexity of determining the relation of one point.
Garey and Johnson has the best introduction to computational complexity I have ever seen.
It has applications to computational complexity(in particular hardness of approximation) and cryptography.
Random oracles have long been considered in computational complexity theory e.g.
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness.
It was introduced to establish computational complexity of sorting and searching.
In the matrix inversion block,the divisor circuit is that adds the highest computational complexity.
The fields of feasible computability and computational complexity study functions that can be computed efficiently.
This technique has the advantages of being robust against noise uncertainty andhaving low computational complexity.
Models of visual attention also help to reduce the computational complexity of image processing applications.
As a consequence, two relation sets having the same polymorphisms lead to the same computational complexity.
Since computational complexity measures difficulty with respect to the length of the(encoded) input, this naive algorithm is actually exponential.
In this work, the used behavioral model is the low-pass equivalent,to reduce the computational complexity.
The complementary field of computational complexity attempts to explain why certain computational problems are intractable for computers.
A variety of methods are available,with different tradeoffs between image quality and computational complexity.
In logic and computational complexity==The transitive closure of a binary relation cannot, in general, be expressed in first-order logic FO.
Normally it is assumed that the reduction in question does not have higher computational complexity than the class itself.
In computational complexity theory, it is usually implicitly assumed that any string in{0, 1}* represents an instance of the computational problem in question.