Factoring by subsets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring Certain Infinite Abelian Groups by Distorted Cyclic Subsets

We will prove that two results on factoring finite abelian groups into a product of subsets, related to Hajós’s and Rédei’s theorems, can be extended for certain infinite torsion abelian groups. Mathematics Subject Classification (2000): Primary 20K01; Secondary

متن کامل

Factoring elementary groups of prime cube order into subsets

Let p be a prime and let G be the 3-fold direct product of the cyclic group of order p. Rédei conjectured if G is the direct product of subsets A and B, each of which contains the identity element of G, then either A or B does not generate all of G. The paper verifies Rédei’s conjecture for p ≤ 11.

متن کامل

Argument Reduction by Factoring

We identify a useful property of a program with respect to a predicate, called factoring. While we prove that detecting factorability is undecidable in general, we show that for a large class of programs, the program obtained by applying the Magic Sets transformation is factorable with respect to the recursive predicate. When the factoring property holds, a simple optimization of the program ge...

متن کامل

Factoring by Electronic Mail

In this paper we describe our distributed implementation of two factoring algorithms. the elliptic curve method (ecm) and the multiple polynomial quadratic sieve algorithm (mpqs). Since the summer of 1987. our erm-implementation on a network of MicroVAX processors at DEC’s Systems Research Center has factored several most and more wanted numbers from the Cunningham project. In the summer of 198...

متن کامل

Factoring by Quantum Computers

A Quantum computer is a device that uses quantum phenomenon to perform a computation. A classical system follows a single computation path. On the other hand a quantum system utilizes the superposition of input states to simultaneously move along all possible paths and finally move to one definite state when measured. This type of parallelism is exploited to find efficient algorithms for proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1967

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1967.22.523