- conjunctive reduction
- мат. конъюнктивное приведение (матриц)
Большой англо-русский и русско-английский словарь. 2001.
conjunctive reduction
Смотреть что такое "conjunctive reduction" в других словарях:
Conjunctive tasks — Psychology … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Romance languages — Romance Geographic distribution: Originally Southern Europe and parts of Africa; now also Latin America, Canada, parts of Lebanon and much of Western Africa Linguistic classification: Indo European Italic … Wikipedia
angiosperm — /an jee euh sperrm /, n. Bot. a plant having its seeds enclosed in an ovary; a flowering plant. Cf. gymnosperm. [ANGIO + SPERM] * * * ▪ plant Introduction any member of the more than 300,000 species of flowering plants (division Anthophyta) … Universalium
Syntactic predicate — A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies the semantic validity of applying a production. It is a simple and effective means of… … Wikipedia
SNP (complexity) — In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph theoretical properties. It forms the basis for the definition of the class… … Wikipedia
Independent set problem — In mathematics, the independent set problem (IS) is a well known problem in graph theory and combinatorics. The independent set problem is known to be NP complete. It is almost identical to the clique problem. Description Given a graph G , an… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Coptic language — Coptic ⲘⲉⲧⲢⲉⲙ̀ⲛⲭⲏⲙⲓ, Μετ Ρεμνχημι Mad.Rmenkami Spoken in Egypt, Canada, Australia, United States … Wikipedia
Cook–Levin theorem — In computational complexity theory, the Cook–Levin theorem, also known as Cook s theorem, states that the Boolean satisfiability problem is NP complete. That is, any problem in NP can be reduced in polynomial time by a deterministic Turing… … Wikipedia
