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 11 of 11 for “"Factorization (Mathematics)"”.
-
Tensor factorization and spin construction for Kac-Moody algebras
… D.)--Michigan State University. Department of Mathematics, 2007
-
Atomicity in Rings with Zero Divisors
In this dissertation, we examine atomicity in rings with zero divisions. We begin by examining the relationship between a ring’s level of atomicity and the highest level of irreducibility shared by the ring’s irreducible elements. Later, we chose one of the higher forms of atomicity and identify …
-
Elliptic curves and their applications in cryptography
… of applications for number theory, such as factorization and primality testing.
-
Quotient posets and the characteristic polynomial
"In this dissertation we consider the generating function for the M öbius function of finite partially ordered sets. This generating function is called the characteristic polynomial of the partially ordered set. We are primarily interested in explaining why certain families of partially ordered …
-
Efficient algorithms for generating high precision binary logarithmic numbers
Thesis (M. S.)--Michigan State University. Department of Electrical Engineering, 1997
-
Factorization
The purpose of this thesis will focus on the two most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.
-
Factorization
The purpose of this thesis will focus on the two most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.
-
Primary decomposition of ideals in a ring
The concept of unique factorization was first recognized in the 1840s, but even then, it was still fairly believed to be automatic. The error of this assumption was exposed largely through attempts to prove Pierre de Fermat's, 1601-1665, last theorem. Once mathematicians discovered that this …
-
Primary decomposition of ideals in a ring
The concept of unique factorization was first recognized in the 1840s, but even then, it was still fairly believed to be automatic. The error of this assumption was exposed largely through attempts to prove Pierre de Fermat's, 1601-1665, last theorem. Once mathematicians discovered that this …
-
Factoring Semiprimes Using PG2N Prime Graph Multiagent Search
In this thesis a heuristic method for factoring semiprimes by multiagent depth-limited search of PG2N graphs is presented. An analysis of PG2Nn graph connectivity is used to generate heuristics for multiagent search. Further analysis is presented including the requirements on choosing prime numbers …