-
1 проблемы, разрешимые за полиномиальное время
Programming: problems solvable in polynomial timeУниверсальный русско-английский словарь > проблемы, разрешимые за полиномиальное время
См. также в других словарях:
Almost Wide Probabilistic Polynomial-Time — In theoretical computer science, Almost Wide Probabilistic Polynomial Time (AWPP) is a complexity class for problems in the context of quantum computing.AWPP contains the BQP (Bounded error, Quantum, Polynomial time) class, which contains the… … Wikipedia
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Millennium Prize Problems — This article is about the math prizes. For the technology prize, see Millennium Technology Prize. Millennium Prize Problems P versus NP problem Hodge conjecture … Wikipedia
RL (complexity) — In computational complexity theory, RL (Randomized Logarithmic space),[1] sometimes called RLP (Randomized Logarithmic space Polynomial time),[2] is the complexity class of problems solvable in logarithmic space and polynomial time with… … Wikipedia
SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
BPL (complexity) — In computational complexity theory, BPL (Bounded error Probabilistic Logarithmic space), [ [http://qwiki.stanford.edu/wiki/Complexity Zoo:B#bpl Complexity Zoo: BPL] ] sometimes called BPLP (Bounded error Probabilistic Logarithmic space Polynomial … Wikipedia
Oracle machine — In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to decide certain decision… … Wikipedia