نتایج جستجو برای: iul factorization

تعداد نتایج: 21839  

2013
Ali Alatabbi Costas S. Iliopoulos Mohammad Sohel Rahman

A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal palindromes in a string in linear time to the length of the given string then using the breadth first sear...

2007
George Janelidze Walter Tholen

A functorial treatment of factorization structures is presented, under extensive use of well-pointed endofunctors. Actually, so-called weak factorization systems are interpreted as pointed lax indexed endofunctors, and this sheds new light on the correspondence between reeective subcategories and factorization systems. The second part of the paper presents two important factorization structures...

Journal: :IACR Cryptology ePrint Archive 2012
Greg Childers

I provide the details of the factorization of the Mersenne number 21061 − 1 by the Special Number Field Sieve. Although this factorization is easier than the completed factorization of RSA-768, it represents a new milestone for factorization using publicly available software.

2007
Anshul Gupta

We have developed a highly parallel sparse Cholesky factorization algorithm that substantially improves the state of the art in parallel direct solution of sparse linear systems—both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. However, it had been a challenge to dev...

Journal: :Computers & Mathematics with Applications 1992

Journal: :Journal de Théorie des Nombres de Bordeaux 2008

Journal: :Nature Photonics 2009

Journal: :Rocky Mountain Journal of Mathematics 1985

Journal: :Communications in Algebra 2022

We extend some results of Brewer and Heinzer about integral domains with certain comaximal factorization properties for ideals, to the more general setup multiplicative lattices.

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید