Examples of using Complexity theory in English and their translations into French
{-}
-
Colloquial
-
Official
In computational complexity theory, the Sipser-Lautemann theorem or Sipser-Gács-Lautemann theorem states that bounded-error probabilistic polynomial(BPP)
Laborit was one of the pioneers of complexity theory and self-organization in France and the initiator of"complex
and computational complexity theory.
In complexity theory, a time-constructible function is a function f from natural numbers to natural numbers with the property that f(n)
In computational complexity theory, 3-dimensional matching is also the name of the following decision problem: given a set T and an integer k, decide whether there exists a
received the 1993 ACM Turing Award"in recognition of their seminal paper which established the foundations for the field of computational complexity theory.
An Adaptive Ecosystem Approach to Managing Urban Environments for Human Health The research of this new scholar grantee focused on the application of adaptive ecosystems approaches and complexity theory to environmental issues,
energy economics and complexity theory.
obesity, and complexity theory- and asked for their best advice on the actions that will have the greatest impact see Appendix 2.
It is also deeply influenced by the readings of Deleuze and Guattari and complexity theory, connecting him to the discourse practiced in America by authors such as Jeffrey Kipnis,
Clear exposition of complexity theory results.
CSPs are also studied in computational complexity theory and finite model theory. .
Finding a largest 3-dimensional matching is a well-known NP-hard problem in computational complexity theory.
In computational complexity theory, the formal language corresponding to the prime numbers is denoted as PRIMES.
Thus the main application areas of FMT are: descriptive complexity theory, database theory
for his work in computational complexity theory.
Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory.
The most interesting open problem in computational complexity theory is the P vs. NP problem.
the subset sum problem is an important decision problem in complexity theory and cryptography.
In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space.