Výsledky vyhledávání - Polynomial factorization algorithm

A fast algorithm for polynomial factorization over ℚ p

Autoři: FORD, David PAULI, Sebastian ROBLOT, Xavier-François

Zdroj: Journal de Théorie des Nombres de Bordeaux, 2002 Jan 01. 14(1), 151-169.

Přístupová URL adresa: https://www.jstor.org/stable/43972647

On a New Factorization Algorithm for Polynomials Over Finite Fields

Autoři: Niederreiter, Harald Göttfert, Rainer

Zdroj: Mathematics of Computation, 1995 Jan 01. 64(209), 347-353.

Přístupová URL adresa: https://www.jstor.org/stable/2153339

Sharp Precision in Hensel Lifting for Bivariate Polynomial Factorization

Zdroj: Mathematics of Computation, 2006 Apr 01. 75(254), 921-933.

Přístupová URL adresa: https://www.jstor.org/stable/4100319

Polynomial Factorization over F 2

Zdroj: Mathematics of Computation, 2002 Oct 01. 71(240), 1677-1698.

Přístupová URL adresa: https://www.jstor.org/stable/4099969

Factoring High-Degree Polynomials Over F2 with Niederreiter's Algorithm on the IBM SP2

Autoři: Roelse, Peter

Zdroj: Mathematics of Computation, 1999 Apr 01. 68(226), 869-880.

Přístupová URL adresa: https://www.jstor.org/stable/2585062

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields: The complete analysis of a polynomial factorization algorithm over finite fields

Autoři: Daniel Panario Xavier Gourdon Philippe Flajolet

Zdroj: Journal of Algorithms. 40:37-81

Témata: polynomial factorization algorithm, algorithm, algebraic complexity, Computational aspects of field theory and polynomials, 0102 computer and information sciences, finite fields, 0101 mathematics, Nonnumerical algorithms, 01 natural sciences, Number-theoretic algorithms, complexity, Polynomials over finite fields

Popis souboru: application/xml

Přístupová URL adresa: https://hal.inria.fr/inria-00073319/file/RR-3370.pdf
https://zbmath.org/1656033
https://doi.org/10.1006/jagm.2001.1158
http://algo.inria.fr/flajolet/Publications/FlGoPa01.pdf
https://www.cs.auckland.ac.nz/~mcw/Teaching/refs/misc/factorization.pdf
https://hal.inria.fr/inria-00073319/document
https://dl.acm.org/doi/10.1006/jagm.2001.1158
https://dblp.uni-trier.de/db/journals/jal/jal40.html#FlajoletGP01
https://core.ac.uk/display/22936951

Polynomial Factorization Over Henselian Fields.

Autoři: Alberich-Carramiñana, Maria Guàrdia, Jordi Nart, Enric a další

Zdroj: Foundations of Computational Mathematics. Apr2025, Vol. 25 Issue 2, p631-681. 51p.

Témata: *NEWTON diagrams, *IRREDUCIBLE polynomials, *ARITHMETIC functions, *FACTORIZATION, *HYPERSURFACES

A New Polynomial Factorization Algorithm and its Implementation: A new polynomial factorization algorithm and its implementation

Autoři: Victor Shoup

Zdroj: Journal of Symbolic Computation. 20:363-397

Témata: polynomial factorization algorithm, Algebra and Number Theory, 0102 computer and information sciences, Symbolic computation and algebraic computation, 01 natural sciences, baby step/giant step factoring method, Polynomials over finite fields, Computational Mathematics, univariate polynomials, Parallel algorithms in computer science, 0101 mathematics, implementation, finite field, Number-theoretic algorithms, complexity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/884780
https://doi.org/10.1006/jsco.1995.1055
https://www.sciencedirect.com/science/article/abs/pii/S0747717185710553
https://nyuscholars.nyu.edu/en/publications/a-new-polynomial-factorization-algorithm-and-its-implementation
https://www.sciencedirect.com/science/article/pii/S0747717185710553
https://dl.acm.org/doi/10.1006/jsco.1995.1055
https://dl.acm.org/citation.cfm?id=226280
https://core.ac.uk/display/82184310

A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Quasi-Cyclic Codes via Polynomial Matrices

Autoři: Hajime MATSUI

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2021, E104.A(11):1649

Antenna Array Design in MIMO Radar Using NSK Polynomial Factorization Algorithm

Autoři: Xiukun Ren Shuainan Gu Na-e Zheng a další

Zdroj: International Journal of Antennas and Propagation, Vol 2016 (2016)

Témata: HE9713-9715, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Cellular telephone services industry. Wireless telephone industry, TK1-9971

Popis souboru: text/xhtml

Přístupová URL adresa: http://downloads.hindawi.com/journals/ijap/2016/4580479.pdf
https://doaj.org/article/815602072e8f44db836ddd3eee53e962
https://core.ac.uk/display/89784341
https://www.hindawi.com/journals/ijap/2016/4580479/
http://downloads.hindawi.com/journals/ijap/2016/4580479.pdf
https://downloads.hindawi.com/journals/ijap/2016/4580479.pdf

The average number of modular factors in Trager's polynomial factorization algorithm

Autoři: Mark J. Encarnación

Zdroj: Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97. :278-281

Témata: 0101 mathematics, 01 natural sciences, Number-theoretic algorithms, complexity, Polynomials (irreducibility, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/61012/1/0986-10.pdf
https://zbmath.org/1322495
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/61012/1/0986-10.pdf
https://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/61012
http://portal.acm.org/citation.cfm?doid=258726.258810
https://dl.acm.org/doi/10.1145/258726.258810
https://dl.acm.org/citation.cfm?doid=258726.258810
https://dblp.uni-trier.de/db/conf/issac/issac97.html#Encarnacion97a

Factorization of Multivariate Polynomials Over Finite Fields

Autoři: Kaltofen, E.

Zdroj: Mathematics of Computation, 1985 Jul 01. 45(171), 251-261.

Přístupová URL adresa: https://www.jstor.org/stable/2008063

An explicit Wiener-Hopf factorization algorithm for matrix polynomials and its exact realizations within ExactMPF package.

Autoři: Adukov VM Adukova NV Mishuris G

Zdroj: Proceedings. Mathematical, physical, and engineering sciences [Proc Math Phys Eng Sci] 2022 Jul; Vol. 478 (2263), pp. 20210941. Date of Electronic Publication: 2022 Jul 06.

Způsob vydávání: Journal Article

Informace o časopise: Publisher: The Society Country of Publication: England NLM ID: 9891746 Publication Model: Print-Electronic Cited Medium: Print ISSN: 1364-5021 (Print) Linking ISSN: 13645021 NLM ISO Abbreviation: Proc Math Phys Eng Sci Subsets: PubMed not MEDLINE

Distinct Degree Factorizations for Polynomials over a Finite Field

Autoři: Knopfmacher, Arnold Warlimont, Richard

Zdroj: Transactions of the American Mathematical Society, 1995 Jun 01. 347(6), 2235-2243.

Přístupová URL adresa: https://www.jstor.org/stable/2154936

Improvements on the Cantor-Zassenhaus factorization algorithm

Autoři: ELIA, Michele Davide Schipani University of Zurich

Přispěvatelé: ELIA, Michele Davide Schipani University of Zurich

Zdroj: Mathematica Bohemica. 140:271-290

Témata: 10123 Institute of Mathematics, 510 Mathematics, polynomial factorization, Cantor-Zassenhaus algorithm, 16. Peace & justice, 2600 General Mathematics

Přístupová URL adresa: http://dml.cz/bitstream/handle/10338.dmlcz/144395/MathBohem_140-2015-3_2.pdf
http://irep.ntu.ac.uk/id/eprint/2605/
https://dml.cz/handle/10338.dmlcz/144395
https://iris.polito.it/handle/11583/2563342
https://www.zora.uzh.ch/id/eprint/128307/
https://www.math.uzh.ch/fileadmin/user/davide/publikation/MB_davide3.pdf
https://eudml.org/doc/271620
https://eudml.org/doc/271620
https://hdl.handle.net/11583/2563342

AN APPLICATION OF BIVARIATE POLYNOMIAL FACTORIZATION ON DECODING OF REED-SOLOMON BASED CODES

Autoři: Pavkov, Ivan Ralević, Nebojša M. Nedović, Ljubo

Zdroj: Applicable Analysis and Discrete Mathematics, 2018 Apr 01. 12(1), 166-177.

Přístupová URL adresa: https://www.jstor.org/stable/90020610

Factorization of long numbers. A polynomial factorization algorithm for a digital computer is proposed

Autoři: Veselov, Vladimir

An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2

Autoři: Göttfert, Rainer

Zdroj: Mathematics of Computation, 1994 Apr 01. 62(206), 831-839.

Přístupová URL adresa: https://www.jstor.org/stable/2153543

Single-factor lifting and factorization of polynomials over local fields

Autoři: Guàrdia Rubies, Jordi Nart, Enric Pauli, S. a další

Přispěvatelé: Guàrdia Rubies, Jordi Nart, Enric Pauli, S. a další

Zdroj: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Témata: Algebra and Number Theory, Mathematics - Number Theory, Polygons, Polynomial factorization, Matemàtiques i estadística::Matemàtica aplicada a les ciències [Àrees temàtiques de la UPC], Newton polygon, Algorismes, Montes approximation, Polynomials, 01 natural sciences, Computational Mathematics, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències, FOS: Mathematics, Okutsu approximation, Polinomis, Number Theory (math.NT), Local field, Montes algorithm, 0101 mathematics, Polígons, Algorithms, 11S15, 11S04, 11Y40

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1104.3181
http://hdl.handle.net/2117/16519
https://www.sciencedirect.com/science/article/pii/S0747717112000363
https://www.sciencedirect.com/science/article/abs/pii/S0747717112000363
https://dblp.uni-trier.de/db/journals/jsc/jsc47.html#GuardiaNP12
https://upcommons.upc.edu/bitstream/handle/2117/16519/single-factor.pdf?sequence=1
https://upcommons.upc.edu/handle/2117/16519
https://core.ac.uk/display/41768613
https://hdl.handle.net/2117/16519
https://doi.org/10.1016/j.jsc.2012.03.001

The Black-Box Niederreiter Algorithm and Its Implementation over the Binary Field

Autoři: Fleischmann, Peter Roelse, Peter

Zdroj: Mathematics of Computation, 2003 Oct 01. 72(244), 1887-1899.

Přístupová URL adresa: https://www.jstor.org/stable/4100025