Log in

Relevant bibliographies by topics / M-Polynomial / Dissertations / Theses

To see the other types of publications on this topic, follow the link: M-Polynomial.

Dissertations / Theses on the topic 'M-Polynomial'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 15 dissertations / theses for your research on the topic 'M-Polynomial.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Zhang, Yuexiu. "Polynomial identities of Lie subalgebras of M(n)." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10367.

Full text

Abstract:

Let $K\sb{n}(F)$ denote the Lie algebra of skew symmetric matrices with coefficients in a field F. For 1 $\le\ k \le\ m$ + 1, define $a\sb{m}(k)(x\sb1,\cdots,x\sb{m};y)\:=\ \sum\sb{\sigma\in{\cal S}\sb{m}} (-1)\sp{\sigma}x\sb{\sigma(1)}\cdots x\sb{\sigma(k-1)}yx\sb{\sigma(k)}\cdots x\sb{\sigma(m)},$ and let $a\sbsp{m}{+}$ (respectively $a\sbsp{m}{-}$) be the sum of all $a\sb{m}(k)$ with k even (respectively odd). This dissertation contains two parts. In the first part (Chapter 2), we prove that the almost standard polynomial $f(x\sb{1},\cdots, x\sb{m};y)\:=\ \alpha a\sbsp{m}{+} + \beta a\sbsp{

APA, Harvard, Vancouver, ISO, and other styles

2

Malagutti, Marcello. "C^m Solutions to a System of Linear Equations with Polynomial Coefficients." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20795/.

Full text

Abstract:

La presente tesi verte sullo studio di una condizione necessaria e sufficiente per l'esistenza di soluzioni C^m, ovvero differenziabili fino all’ordine m, di un sistema di equazioni lineari. Con maggior dettaglio, in primo luogo vengono esposti gli studi di Charles Fefferman e Garving K. Luli, proposti nel lavoro “Solutions to a system of equations for C^m function”, nel caso in cui il sistema lineare considerato sia a coefficienti polinomiali. In secondo luogo viene introdotto un nuovo risultato per la determinazione di una condizione necessaria e sufficiente per l'esistenza di soluzioni con

APA, Harvard, Vancouver, ISO, and other styles

3

Sessler, Gunther M. A. [Verfasser]. "Schnell konvergierender Polynomial Expansion Multiuser Detektor mit niedriger Komplexität / Gunther M. A. Sessler." Karlsruhe : Inst. für Nachrichtentechnik, 2003. http://d-nb.info/1005262462/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ahmad, Khan Mumtaz, and Bahman Alidad. "Three Variable Analogue of Boas and Buck Type Generating Functions and Its Generalizations to M-Variables." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/97282.

Full text

Abstract:

The present papers deals with three variable analogue of Boas and Buck [14] type generating functions forpolynomials of two variables and then the same has been extended for m-variable analogue. The results obtained are extensions of those obtained by us in our earlier paper [14].<br>El presente artículo trata el anólogo de tres variables de la función generatriz de Boas and Buck [14] para polinomios de dos variables y lo mismo se puede extender para el análogo de m variables. Los resultados obtenidos son extensiones de un artículo previo [14].

APA, Harvard, Vancouver, ISO, and other styles

5

Novel, Aymeric. "Développement d’une méthode de méta modélisation des consommations énergétiques des bâtiments en fonction des facteurs d’usages et d’exploitation pour la garantie de résultat énergétique." Thesis, La Rochelle, 2019. http://www.theses.fr/2019LAROS001/document.

Full text

Abstract:

À mesure que les performances intrinsèques des bâtiments s’améliorent, les usages énergétiques non réglementés, que nous associons à une notion d’intensité énergétique des usages, prennent de plus en plus d’importance dans le bilan des consommations des bâtiments. De plus, les bâtiments performants font apparaître des problématiques au niveau de l’exploitation des installations. Ces constats nous permettent d’affirmer qu’il est aujourd’hui important de proposer un cadre pour le suivi et l’optimisation de la sobriété énergétique des usages et l’exploitation performante pour la maîtrise des cons

APA, Harvard, Vancouver, ISO, and other styles

6

Nicacio, Nilson Herminio. "Uma justificava da validade do teorema fundamental da ?lgebra para o ensino m?dio." Universidade Federal do Rio Grande do Norte, 2013. http://repositorio.ufrn.br:8080/jspui/handle/123456789/18666.

Full text

Abstract:

Made available in DSpace on 2015-03-03T15:36:13Z (GMT). No. of bitstreams: 1 NilsonHN_DISSERT.pdf: 1119783 bytes, checksum: 06971d48c83bfd25f8c12df9752dbc20 (MD5) Previous issue date: 2013-08-14<br>Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior<br>Among several theorems which are taught in basic education some of them can be proved in the classroom and others do not, because the degree of difficulty of its formal proof. A classic example is the Fundamental Theorem of Algebra which is not proved, it is necessary higher-level knowledge in mathematics. In this paper, we just

APA, Harvard, Vancouver, ISO, and other styles

7

Tosun, Cemile. "Explicit Factorization of Generalized Cyclotomic Polynomials of Order $2^m 3$ Over a Finite Field $F_q$." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/733.

Full text

Abstract:

We give explicit factorizations of $a$-cyclotomic polynomials of order $2^m 3$, $Q_{2^m3,a}(x)$, over a finite field $F_q$ with $q$ elements where $q$ is a prime power, $m$ is a nonnegative integer and $a$ is a nonnegative element of $F_q$. We use the relation between usual cyclotomic polynomials and $a$-cyclotomic polynomials. Factorizations split into eight categories according to $q \equiv \pm1$ (mod 4), $a$ and $-3$ are square in $F_q$. We find that the coefficients of irreducible factors are primitive roots of unity and in some cases that are related with Dickson polynomials.

APA, Harvard, Vancouver, ISO, and other styles

8

Pallone, Ashley H. "Entangled Polynomials." Ohio University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1615312851673664.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sabbah, Camille. "Contribution à l'étude des M-estimateurs polynômes locaux." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00509898.

Full text

Abstract:

L'objet de cette thèse est d'établir des résultats asymptotiques pour l'estimateur du quantile conditionnel par la méthode des polynômes locaux ainsi qu'à la généralisation de ces résultats pour les M-estimateurs. Nous étudions ces estimateurs et plus particulièrement leur représentation de Bahadur et leur biais. Nous donnons en outre un résultat sur les intervalles de confiance uniformes construits à partir de cette représentation pour le quantile conditionnel et ses dérivées.

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Yih-Ming, and 黃育民. "Concurrent Error Correction in Polynomial Basis Multiplier over GF(2^m)." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/39466757162325476703.

Full text

Abstract:

碩士<br>清雲科技大學<br>電子工程研究所<br>93<br>Appling the technique of Galois field, i.e, finite field multiplier, to cryptology has gained much concern been rising during the recent years. Such a technigue is also widely utilized in the fields of coding theory, cryptography, digital signal processing, switching theory, channel coding of communication systems, and pseudorandom number generation. In the field of cryptography, many researchers have worked hard to develop undecipherable cryptography, while the other researchers have tried to find a way to decipher already published cryptography. The newest cr

APA, Harvard, Vancouver, ISO, and other styles

11

Nia, Ali. "VHDL Implementation of PPR Systolic Array Architecture for Polynomial GF(2^m) Multiplication." Thesis, 2013. http://hdl.handle.net/1828/4575.

Full text

Abstract:

This thesis is devoted to efficient VHDL design of Systolic Array Architecture for Polynomial GF(2^m) multiplication. The hardware implements the Processor Elements(PE) and Systolic Array design for Progressive Product Reduction (PPR) method proposed by Gebali and Atef. The experiment first implements a simpler irreducible polynomials GF(2^5) based on the defined algorithms for PPR in order to confirm the functionality of the design and then tries the bigger value of m for GF(2^133) and GF(2^233), recommended by NIST. The thesis is comparing the three designs based on their power consumptio

APA, Harvard, Vancouver, ISO, and other styles

12

高照程. "Image denoising by the method of the local p-degree polynomial m-smoother." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/76736682751745704124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Chang, Chi Hiang, and 張智翔. "Concurrent Error Detection and Correction in Polynomial Basis Multiplier over GF(2^m)." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/06617899142859041297.

Full text

Abstract:

碩士<br>清雲科技大學<br>電子工程研究所<br>94<br>Finite field arithmetic has been widely used in many cryptosystems, especially Elliptic Curve Cryptosystem (ECC), for speeding their encryption/decryption processes. Regular structures of finite field arithmetic are suitable for VLSI implementation and then make them very attractive for mobile commerce. The multiplication is the most critical operation in finite field arithmetic operations. Recently, a new cryptanalysis, termed fault based cryptanalysis which deliberates fault injection into cryptographic devices, only require a small amount of side-channel inf

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Cheng-Sheng, and 陳正昇. "The Study of Computing The Greatest Common Divisor of Polynomial in GF(p^m) Based on Right-shift K-ary Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/82235690441547202566.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系碩士班<br>96<br>The Euclidean algorithm is the ancient and the most common algorithm used for computing the greatest common divisor of polynomials (GCDP) in Galois ﬁelds GF(2^m). But it is inefficient for computing GCDP in the long polynomials. In 2006, Argüello improved the Euclidean algorithm by using the Lehmer''s algorithm to reduces the number of long polynomial operations. Argüello''s algorithm aims at calculating the GCDP in the long polynomials. The leading terms of two polynomials inputs are extracted to compute the continued fractions. These continued fractions are

APA, Harvard, Vancouver, ISO, and other styles

15

Maciak, Matúš. "Flexibilnost, robustnost a nespojitost v neparamerických regresních postupech." Doctoral thesis, 2011. http://www.nusl.cz/ntk/nusl-299530.

Full text

Abstract:

Thesis title: Flexibility, Robustness and Discontinuity in Nonparametric Regression Approaches Author: Mgr. Matúš Maciak, M.Sc. Department: Department of Probability and Mathematical Statistics, Charles University in Prague Supervisor: Prof. RNDr. Marie Hušková, DrSc. huskova@karlin.mff.cuni.cz Abstract: In this thesis we focus on local polynomial estimation approaches of an unknown regression function while taking into account also some robust issues like a presence of outlying observa- tions or heavy-tailed distributions of random errors as well. We will discuss the most common method used f

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!