Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"multivariate polynomials"”.

  1. Low rank decompositions for sum of squares optimization

    … of Squares (SOS) decomposition of univariate and multivariate polynomials. This representation formulates a SOS problem by interpolating a polynomial at a finite set of sampling points. As compared to the conventional coefficient method of SOS, the formulation has a low rank property in its …

    mit Repository record for Low rank decompositions for sum of squares optimization (opens in a new tab)

  2. Light-Front Coupled-Cluster Method In Phi-Four Field Theory

    … construction of a new type of fully symmetric multivariate polynomials used as basis functions for the numerical solution of the LFCC equations. The approximations made for the purpose of this investigation prevented the full scope of symmetry breaking from being observed, but the foundation …

    umn Repository record for Light-Front Coupled-Cluster Method In Phi-Four Field Theory (opens in a new tab)

  3. Secure Computation in Heterogeneous Environments: How to Bring Multiparty Computation Closer to Practice?

    … that use large databases. We also consider multivariate polynomials which yield more succinct representations for the functionalities they implement than circuits, and at the same time a large collection of problems are naturally and efficiently expressed as multivariate polynomials. We …

    columbia-diss Repository record for Secure Computation in Heterogeneous Environments: How to Bring Multiparty Computation Closer to Practice? (opens in a new tab)

  4. Grobner Bases and Ideals of Points

    … Buchberger's Algorithm, in which the notion of S-polynomials is introduced, and a few modified or improved versions of Grobner basis algorithm are reviewed in this paper. In Chapter 1, we have a review of ideals, the definitions and types of monomial ordering, the multivariate polynomial division …

    vcu Repository record for Grobner Bases and Ideals of Points (opens in a new tab)

  5. Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica

    … construction of formally verified libraries for multivariate polynomials within the framework provided by the ACL2 computational logic. Since ACL2 integrates a pure functional programming language and an automated reasoning system, these libraries can be used for both computation and formal …

    cadiz Repository record for Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica (opens in a new tab)

  6. Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics

    … of biological networks is the collection of all polynomials that vanish on this set of points, the so-called ideal of points. Polynomial ideals can be represented through a special finite generating set, known as Gröbner basis, that possesses some desirable properties. For a given ideal, …

    vt Repository record for Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics (opens in a new tab)

  7. Repairing Cartesian Codes with Linear Exact Repair Schemes

    In this paper, we develop a scheme to recover a single erasure when using a Cartesian code,in the context of a distributed storage system. Particularly, we develop a scheme withconsiderations to minimize the associated bandwidth and maximize the associateddimension. The problem of recovering a …

    vt Repository record for Repairing Cartesian Codes with Linear Exact Repair Schemes (opens in a new tab)