Výsledky vyhľadávania - Polynomial factorization algorithm

Upresniť hľadanie
  1. 1

    Algorithm for spectral factorization of polynomial matrices on the real line: Algorithm for spectral factorization of polynomial Autor Ephremidze, Lasha

    ISSN: 2662-2009, 2538-225X
    Vydavateľské údaje: Cham Springer International Publishing 01.01.2025
    Vydané v Advances in operator theory (01.01.2025)
    “…In this paper, we extend the basic idea of the Janashia–Lagvilava algorithm to adapt it for the spectral factorization of positive-definite polynomial matrices on the real line…”
    Získať plný text
    Journal Article
  2. 2

    An explicit Wiener-Hopf factorization algorithm for matrix polynomials and its exact realizations within ExactMPF package Autor Adukov, V M, Adukova, N V, Mishuris, G

    ISSN: 1364-5021
    Vydavateľské údaje: England 01.07.2022
    “…We discuss an explicit algorithm for solving the Wiener-Hopf factorization problem for matrix polynomials…”
    Zistit podrobnosti o prístupe
    Journal Article
  3. 3

    A note on Gao’s algorithm for polynomial factorization Autor Hoppen, Carlos, Rodrigues, Virginia M., Trevisan, Vilmar

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 01.04.2011
    Vydané v Theoretical computer science (01.04.2011)
    “…Shuhong Gao (2003) [6] has proposed an efficient algorithm to factor a bivariate polynomial f over a field F…”
    Získať plný text
    Journal Article
  4. 4
  5. 5

    Antenna Array Design in MIMO Radar Using NSK Polynomial Factorization Algorithm Autor Zheng, Nae, Ren, Xiukun, Li, Ke, Gu, Shuainan

    ISSN: 1687-5869, 1687-5877
    Vydavateľské údaje: Cairo, Egypt Hindawi Publishing Corporation 01.01.2016
    “… In addition, an algorithm based on Newton-Schubert-Kronecker (NSK) polynomial factorization is proposed…”
    Získať plný text
    Journal Article
  6. 6

    Verifiable outsourced computation over encrypted data Autor Yu, Xixun, Yan, Zheng, Zhang, Rui

    ISSN: 0020-0255, 1872-6291
    Vydavateľské údaje: Elsevier Inc 01.04.2019
    Vydané v Information sciences (01.04.2019)
    “…•An end-to-end system enables the public to verify outsourced computations.•Perform computations in ciphertexts in order to preserve data…”
    Získať plný text
    Journal Article
  7. 7

    Improved dense multivariate polynomial factorization algorithms Autor Lecerf, Grégoire

    ISSN: 0747-7171, 1095-855X
    Vydavateľské údaje: Elsevier Ltd 2007
    “…We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several variables to one variable…”
    Získať plný text
    Journal Article
  8. 8

    Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition Autor Wang, Zeliang, McWhirter, John G., Weiss, Stephan

    ISSN: 1058-6393
    Vydavateľské údaje: IEEE 01.11.2015
    “…In this paper, we present a new multichannel spectral factorization algorithm which can be utilized to calculate the approximate spectral factor of any para-Hermitian polynomial matrix…”
    Získať plný text
    Konferenčný príspevok.. Journal Article
  9. 9
  10. 10
  11. 11

    On the acceleration of an algorithm for polynomial factorization Autor Malyshev, A. N.

    ISSN: 1064-5624, 1531-8362
    Vydavateľské údaje: Boston Springer US 01.09.2013
    Vydané v Doklady. Mathematics (01.09.2013)
    Získať plný text
    Journal Article
  12. 12

    Polynomial factorization algorithms over number fields Autor Roblot, Xavier-François

    ISSN: 0747-7171, 1095-855X
    Vydavateľské údaje: Elsevier Ltd 01.11.2004
    Vydané v Journal of symbolic computation (01.11.2004)
    “…The aim of this paper is to describe two new factorization algorithms for polynomials…”
    Získať plný text
    Journal Article
  13. 13

    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer Autor Shor, Peter W.

    ISSN: 0097-5397, 1095-7111
    Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.10.1997
    Vydané v SIAM journal on computing (01.10.1997)
    “… These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored…”
    Získať plný text
    Journal Article
  14. 14

    Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation Autor Emelyanov, P. G., Krishna, M., Kulkarni, V., Nandy, S. K., Ponomaryov, D. K., Raha, S.

    ISSN: 0361-7688, 1608-3261
    Vydavateľské údaje: Moscow Pleiades Publishing 01.03.2021
    Vydané v Programming and computer software (01.03.2021)
    “…Polynomial factorization is a classical algorithmic algebra problem with a wide range of applications…”
    Získať plný text
    Journal Article
  15. 15

    Polynomial Factorization Over Henselian Fields Autor Alberich-Carramiñana, Maria, Guàrdia, Jordi, Nart, Enric, Poteaux, Adrien, Roé, Joaquim, Weimann, Martin

    ISSN: 1615-3375, 1615-3383
    Vydavateľské údaje: New York Springer US 01.04.2025
    “… This allows us to develop a polynomial factorization algorithm and an irreducibility test that go beyond the classical discrete, rank-one case…”
    Získať plný text
    Journal Article
  16. 16

    An Algorithm for the Factorization of Split Quaternion Polynomials Autor Scharler, Daniel F., Schröcker, Hans-Peter

    ISSN: 0188-7009, 1661-4909, 1661-4909
    Vydavateľské údaje: Cham Springer International Publishing 01.07.2021
    Vydané v Advances in applied Clifford algebras (01.07.2021)
    “…We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists…”
    Získať plný text
    Journal Article
  17. 17

    A New Polynomial Factorization Algorithm and its Implementation Autor Shoup, Victor

    ISSN: 0747-7171, 1095-855X
    Vydavateľské údaje: Elsevier Ltd 1995
    “…We consider the problem of factoring univariate polynomials over a finite field. We demonstrate that the new baby step/giant step factoring method, recently developed by Kaltofen and Shoup, can be made into a very practical algorithm…”
    Získať plný text
    Journal Article
  18. 18

    A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm Autor Divasón, Jose, Joosten, Sebastiaan J. C., Thiemann, René, Yamada, Akihisa

    ISSN: 0168-7433, 1573-0670, 1573-0670
    Vydavateľské údaje: Dordrecht Springer Netherlands 01.04.2020
    Vydané v Journal of automated reasoning (01.04.2020)
    “… We further adapt an existing formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide an efficient and certified factorization algorithm for arbitrary univariate polynomials…”
    Získať plný text
    Journal Article
  19. 19

    Modular Las Vegas algorithms for polynomial absolute factorization Autor Bertone, Cristina, Chèze, Guillaume, Galligo, André

    ISSN: 0747-7171, 1095-855X
    Vydavateľské údaje: Elsevier Ltd 01.12.2010
    Vydané v Journal of symbolic computation (01.12.2010)
    “…Let f(X,Y)∈Z[X,Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p…”
    Získať plný text
    Journal Article
  20. 20

    The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields Autor Flajolet, P., Gourdon, X., Panario, D.

    ISSN: 0196-6774, 1090-2678
    Vydavateľské údaje: San Diego, CA Elsevier Inc 01.07.2001
    Vydané v Journal of algorithms (01.07.2001)
    “… An outcome is a complete analysis of the standard polynomial factorization chain that is based on the elimination of repeated factors, distinct degree factorization, and equal degree separation…”
    Získať plný text
    Journal Article