- solvable subset
- мат. разрешимое подмножество
Большой англо-русский и русско-английский словарь. 2001.
solvable subset
Смотреть что такое "solvable subset" в других словарях:
Solvable Lie algebra — In mathematics, a Lie algebra g is solvable if its derived series terminates in the zero subalgebra. That is, writing for the derived Lie algebra of g, generated by the set of values [x,y] for x and y in g, the derived series … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Banach–Tarski paradox — The Banach–Tarski paradox is a theorem in set theoretic geometry which states that a solid ball in 3 dimensional space can be split into several non overlapping pieces, which can then be put back together in a different way to yield two identical … Wikipedia
IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists … Wikipedia
Merkle-Hellman — (MH) was one of the earliest public key cryptosystems and was invented by Ralph Merkle and Martin Hellman in 1978. [Ralph Merkle and Martin Hellman, Hiding Information and Signatures in Trapdoor Knapsacks, IEEE Trans. Information Theory , 24(5),… … Wikipedia
P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… … Wikipedia
Merkle–Hellman knapsack cryptosystem — The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems invented by Ralph Merkle and Martin Hellman in 1978.[1] Although its ideas are elegant, and far simpler than RSA, it has been broken.[2] Contents 1… … Wikipedia
NC (complexity) — Unsolved problems in computer science Is NC = P ? In complexity theory, the class NC (for Nick s Class ) is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
