Suchergebnisse
Ähnlicher Begriff: close of a computational algorithmus
Der Artikel „Closure of a computational algorithm“ existiert in der deutschsprachigen Wikipedia nicht. Du kannst den Artikel erstellen (Quelltext-Editor, Anleitung).
Wenn dir die folgenden Suchergebnisse nicht weiterhelfen, wende dich bitte an die Auskunft oder suche nach „Closure of a computational algorithm“ in anderssprachigen Wikipedias.
- closure. Rees algebras, multiplicities, algorithms, Springer Verlag, Berlin 2005 (Onlineversion (Auszug)) Aron Simis, Bernd Ulrich, Craig Huneke: A Special…6 KB (483 Wörter) - 16:09, 16. Jan. 2025
Suchergebnisse von der englischsprachigen Wikipedia.
- In mathematics, the transitive closure R+ of a homogeneous binary relation R on a set X is the smallest relation on X that contains R and is transitive…17 KB (2.306 Wörter) - 06:38, 14. Okt. 2025
- Johnson's algorithm: all pairs shortest path algorithm in sparse weighted directed graph Transitive closure problem: find the transitive closure of a given…72 KB (7.923 Wörter) - 17:25, 29. Okt. 2025
- Convex hull (Weiterleitung von „Convex closure“)by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane…58 KB (7.173 Wörter) - 04:01, 2. Sep. 2025
- simple modifications to the algorithm. Versions of the algorithm can also be used for finding the transitive closure of a relation R {\displaystyle R}…24 KB (3.098 Wörter) - 18:21, 23. Okt. 2025
- of Four Russians or "The Four-Russians speedup," is a technique for speeding up algorithms involving Boolean matrices, or more generally algorithms involving…5 KB (590 Wörter) - 22:41, 13. Okt. 2025
- science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems…9 KB (1.189 Wörter) - 06:05, 24. Jun. 2025
- Complexity class (Weiterleitung von „Computational complexity classes“)In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…76 KB (10.502 Wörter) - 20:56, 20. Sep. 2025
- Directed acyclic graph (Weiterleitung von „Applications of directed acyclic graphs“)and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling)…45 KB (5.654 Wörter) - 22:43, 16. Okt. 2025
- well as a test domain in artificial intelligence. Algorithms – Sequential and parallel computational procedures for solving a wide range of problems…11 KB (1.036 Wörter) - 11:39, 22. Okt. 2025
- completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations (over terms) into a confluent…21 KB (2.412 Wörter) - 10:02, 15. Sep. 2025
- combinatorial optimization, a closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight…12 KB (1.622 Wörter) - 20:54, 12. Okt. 2024
- Simultaneous localization and mapping (Weiterleitung von „Loop closure“)filter, covariance intersection, and GraphSLAM. SLAM algorithms are based on concepts in computational geometry and computer vision, and are used in robot…31 KB (3.878 Wörter) - 16:39, 3. Sep. 2025
- Gröbner basis (Weiterleitung von „Multivariate division algorithm“)algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial…63 KB (10.068 Wörter) - 08:20, 26. Aug. 2025
- Real closed field (Weiterleitung von „Real closure“)Pollack, and Marie-Françoise Roy (2003) "Algorithms in real algebraic geometry" in Algorithms and computation in mathematics. Springer. ISBN 3-540-33098-4…22 KB (3.149 Wörter) - 03:55, 18. Okt. 2025
- Savitch's theorem (Kategorie Theorems in computational complexity theory)In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…8 KB (1.094 Wörter) - 20:56, 20. Sep. 2025
- Transitive reduction (Kategorie Graph algorithms)sets obtained during the algorithm describe the transitive closure of the input. If the graph is given together with a partition of its vertices into k chains…16 KB (2.279 Wörter) - 10:46, 14. Sep. 2025
- In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that…15 KB (1.940 Wörter) - 11:17, 2. Jun. 2025
- Algebraic geometry (Weiterleitung von „Computational algebraic geometry“)and Daniel Lazard presented a new algorithm for solving systems of homogeneous polynomial equations with a computational complexity which is essentially…62 KB (7.525 Wörter) - 09:38, 3. Sep. 2025
- of the most practical models of computation, since there is a trivial linear time, constant-space, online algorithm to simulate a DFA on a stream of input…29 KB (3.736 Wörter) - 07:30, 14. Apr. 2025
- In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form x 2 ≡ n ( mod p ) , {\displaystyle x^{2}\equiv…13 KB (3.042 Wörter) - 06:54, 24. Jun. 2025
- Steiner tree problem (Kategorie Geometric algorithms)paths problem to compute the metric closure, then by solving the minimum spanning tree problem. Another popular algorithm to approximate the Steiner tree…36 KB (4.416 Wörter) - 01:53, 24. Jul. 2025
- Venkataraman; N. Sankaran: A generalization of the ordered group of integers, S. 21 GDZ Göttingen Julian Petresco: Algorithmes de décision et de construction
- e. not isomorphic to the spectrum of a ring). This rests on the reinterpretation of tight closure as solid closure. For this (non) affineness property