• OCTAL

• Referenced in 2 articles [sw29609]
• OCTAL: Optimal Completion of gene trees in polynomial time. Background: For a combination of reasons ... gene trees can impact downstream analyses, accurate completion of gene trees is desirable. Results...

• Chordal

• Referenced in 6 articles [sw27125]
• polynomial set can be described with a graph. By exploiting some suitable ”chordal completion...

• RevSCA

• Referenced in 2 articles [sw37909]
• existing SCA methods are completely blind on the resulting polynomials, and their techniques for effective...

• POLYNOMIAL

• Referenced in 4 articles [sw20655]
• polynomial in Bernstein form when the polynomial is not given with this representation are provided ... have completed the library with other algorithms to perform other usual operations with polynomials...

• SLIDE

• Referenced in 8 articles [sw08449]
• propagate SLIDE and provide a complete propagator for CardPath. Since propagation is NP-hard ... identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE...

• BoijSoederbergCICone.m2

• Referenced in 3 articles [sw24208]
• diagrams of complete intersections. We investigate decompositions of Betti diagrams over a polynomial ring within ... decompose it into the Betti diagrams of complete intersections. To do so, we determine...

• RAEEM

• Referenced in 14 articles [sw00773]
• package RAEEM which is a comprehensive and complete implementation of such methods as the tanh ... exact traveling wave solutions, including those of polynomial, exponential, triangular, hyperbolic, rational, Jacobi elliptic, Weierstrass...

• CoLoSS

• Referenced in 14 articles [sw07016]
• compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics ... easily integrated into CoLoSS by providing a complete axiomatisation of their semantics in a specific...

• MinimalInvolutiveMonomialBasis

• Referenced in 1 article [sw27979]
• these divisions produces its own completion procedure. For the polynomial case it yields an involutive...

• Algebraic Numbers

• Referenced in 1 article [sw28608]
• existing libraries for matrices, factorization of rational polynomials, and Sturm’s theorem, we formalized algebraic ... compute roots and completely factorize real and complex polynomials, provided that all coefficients are rational...

• HBAC

• Referenced in 2 articles [sw09882]
• programs is EXPTIME-complete, while the problem is solvable in polynomial time under a reasonable...

• BertiniLab

• Referenced in 6 articles [sw14295]
• Bertini is described. Bertini solves systems of polynomial equations. BertiniLab can be used to create ... specific kind of problem. A complete example of an application to ferromagnetism is presented...

• nsga2R

• Referenced in 2 articles [sw28714]
• crossover, and polynomial mutation are called in the main program, nsga2R, to complete the search...

• CLab

• Referenced in 2 articles [sw31191]
• fast (polynomial) and used to make the interactive product configuration process complete and backtrack-free...

• CABAL

• Referenced in 2 articles [sw32208]
• CABAL: Polynomial and power series algebra on a parallel computer. The work on designing ... completed. Our initial system described here is designed to perform simple polynomial and power series...

• AlgRemez

• Referenced in 4 articles [sw23218]
• Remez algorithm which calculates optimal rational (and polynomial) approximations to the nth root over ... program, is quite difficult to get completely correct, e.g., the Maple implementation of the algorithm...

• HEWN

• Referenced in 3 articles [sw02189]
• problem. This paper presents an algorithm with polynomial time complexity for CLIQUE problem. A Hierarchical ... which is equivalent to the corresponding Maximum Complete Subgraph Tree (MCST) is proposed ... time complexity of building HEWN is polynomial. The implementation results coincide with the proofs...

• ClusterES

• Referenced in 7 articles [sw18311]
• basis functions in this method form a complete orthonormal set and are expressible in terms ... combination of preconditioned block eigensolvers and Chebyshev polynomial filter accelerated subspace iterations. Several algorithmic...

• MHS

• Referenced in 4 articles [sw31594]
• completed finite period map and Galois theory of supercongruences. A period is a complex number ... finitely many inequalities between polynomials with rational coefficients. Although periods are typically transcendental numbers, there...

• Jordan Normal Forms

• Referenced in 6 articles [sw28566]
• theory, namely that the growth rate is polynomially bounded if and only if the spectral ... suitable setup of the code generator. It completely subsumes our former AFP-entry on executable...