Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое complete lattice - определение
Найдено результатов: 799
Complete lattice
PARTIALLY ORDERED SET IN WHICH ALL SUBSETS HAVE BOTH A SUPREMUM AND INFIMUM
Complete lattices; Complete free lattice; Complete homomorphism; Complete lattice homomorphism; Locally finite complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice.
complete lattice
PARTIALLY ORDERED SET IN WHICH ALL SUBSETS HAVE BOTH A SUPREMUM AND INFIMUM
Complete lattices; Complete free lattice; Complete homomorphism; Complete lattice homomorphism; Locally finite complete lattice
A lattice is a partial ordering of a set under a relation
where all finite subsets have a least upper bound and a
greatest lower bound. A complete lattice also has these for
infinite subsets. Every finite lattice is complete. Some
authors drop the requirement for greatest lower bounds.
(1994-12-02)
Lattice QCD
QUANTUM CHROMODYNAMICS ON A LATTICE
QCD lattice model; Lattice qcd; Lattice quantum chromodynamics; Lattice Quantum Chromodynamics; Lattice chromodynamics; LQCD
Lattice QCD is a well-established non-perturbative approach to solving the quantum chromodynamics (QCD) theory of quarks and gluons. It is a lattice gauge theory formulated on a grid or lattice of points in space and time.
Bravais lattice
AN INFINITE ARRAY OF DISCRETE POINTS IN THREE DIMENSIONAL SPACE GENERATED BY A SET OF DISCRETE TRANSLATION OPERATIONS
Crystal lattice; Bravais lattices; Bravais Lattices; Crystalline lattice; Space lattice; Crystallographic lattice; Bravais flock; Crystal lattices
In geometry and crystallography, a Bravais lattice, named after , is an infinite array of discrete points generated by a set of discrete translation operations described in three dimensional space by
crystal lattice
AN INFINITE ARRAY OF DISCRETE POINTS IN THREE DIMENSIONAL SPACE GENERATED BY A SET OF DISCRETE TRANSLATION OPERATIONS
Crystal lattice; Bravais lattices; Bravais Lattices; Crystalline lattice; Space lattice; Crystallographic lattice; Bravais flock; Crystal lattices
¦ noun the symmetrical three-dimensional arrangement of atoms inside a crystal.
Lattice truss bridge
![[[Root Road Covered Bridge]], [[Ashtabula County, Ohio]]](https://commons.wikimedia.org/wiki/Special:FilePath/Astabula Cty (Root Road) townsend latice1982.jpg?width=200 "[[Root Road Covered Bridge]], [[Ashtabula County, Ohio]]")
![Belfast truss as roof support in an aircraft hangar from the [[First World War]] at the [[Duxford Imperial War Museum]]](https://commons.wikimedia.org/wiki/Special:FilePath/De Havilland Sea Vixen REJS.jpg?width=200 "Belfast truss as roof support in an aircraft hangar from the [[First World War]] at the [[Duxford Imperial War Museum]]")
TYPE OF TRUSS BRIDGE THAT USES MANY CLOSELY SPACED DIAGONAL ELEMENTS
Town lattice; Lattice bridges; Town's lattice truss; Town's truss; Lattice bridge; Town truss; Town lattice truss; Lattice truss; Belfast truss
A lattice bridge is a form of truss bridge that uses many small, closely spaced diagonal elements forming a lattice. The lattice Truss Bridge was patented in 1820 by architect Ithiel Town.
complete graph
SIMPLE UNDIRECTED GRAPH IN WHICH EVERY PAIR OF DISTINCT VERTICES IS CONNECTED BY A UNIQUE EDGE
Full graph; Complete Digraph; Complete digraph; K n; Tetrahedral Graph; Complete graphs
A graph which has a link between every pair of nodes. A
complete bipartite graph can be partitioned into two subsets
of nodes such that each node is joined to every node in the
other subset.
(1995-01-24)
Complete (complexity)
NOTION OF THE "HARDEST" OR "MOST GENERAL" PROBLEM IN A COMPLEXITY CLASS
Complete problem; Hard (complexity)
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
♯P-complete
COMPLEXITY CLASS
Sharp-P-Complete; Sharp P complete; Number-P hard; Number-P-complete; Sharp-P hard; Sharp-P-complete
The #P-complete problems (pronounced "sharp P complete" or "number P complete") form a complexity class in computational complexity theory. The problems in this complexity class are defined by having the following two properties:
Lattice (order)
!['''Pic. 7:''' Non-lattice poset: <math>b</math> and <math>c</math> have common upper bounds <math>d, e,</math> and <math>f,</math> but none of them is the [[least upper bound]].](https://commons.wikimedia.org/wiki/Special:FilePath/NoLatticeDiagram.svg?width=200 "'''Pic. 7:''' Non-lattice poset: <math>b</math> and <math>c</math> have common upper bounds <math>d, e,</math> and <math>f,</math> but none of them is the [[least upper bound]].")
!['''Pic. 8:''' Non-lattice poset: <math>a</math> and <math>b</math> have common lower bounds <math>0, d, g, h,</math> and <math>i,</math> but none of them is the [[greatest lower bound]].](https://commons.wikimedia.org/wiki/Special:FilePath/Pow3nonlattice.svg?width=200 "'''Pic. 8:''' Non-lattice poset: <math>a</math> and <math>b</math> have common lower bounds <math>0, d, g, h,</math> and <math>i,</math> but none of them is the [[greatest lower bound]].")
!['''Pic. 1:''' Subsets of \{x, y, z\}, under [[set inclusion]]. The name "lattice" is suggested by the form of the [[Hasse diagram]] depicting it.](https://commons.wikimedia.org/wiki/Special:FilePath/Hasse diagram of powerset of 3.svg?width=200 "'''Pic. 1:''' Subsets of \{x, y, z\}, under [[set inclusion]]. The name \"lattice\" is suggested by the form of the [[Hasse diagram]] depicting it.")
![partition]]s of \{1, 2, 3, 4\}, ordered by "''refines''".](https://commons.wikimedia.org/wiki/Special:FilePath/Lattice of partitions of an order 4 set.svg?width=200 "partition]]s of \{1, 2, 3, 4\}, ordered by \"''refines''\".")
PARTIALLY ORDERED SET THAT ADMITS GREATEST LOWER AND LEAST UPPER BOUNDS
Lattice theory; Bounded lattice; Lattice (algebra); Lattice (order theory); Lattice homomorphism; Lattice Homomorphism; Lattice Automorphism; Lattice automorphism; Lattice Endomorphism; Lattice endomorphism; Lattice Isomorphism; Lattice isomorphism; Sublattice; Lattice order; Conditionally complete lattice; Complement (order theory); Jordan–Dedekind chain condition; Jordan-Dedekind chain condition; Jordan-Dedekind property; Jordan-Dedekind lattice; Jordan-dedekind property; Jordan-dedekind lattice; Jordan–Dedekind lattice; Partial lattice; Join-irreducible; Meet-irreducible; Join-prime; Meet-prime; Separating lattice homomorphism; Complementation (lattice theory); Complement (lattice theory)
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
