Prime factorization by interval-valued computing

dc.contributor.authorVályi, Sándor
dc.contributor.authorNagy, Benedek
dc.date.accessioned2012-06-15T08:36:33Z
dc.date.available2012-06-15T08:36:33Z
dc.date.issued2012-06-15
dc.date.year2011
dc.description.abstractInterval-valued computing is a new theoretical computing paradigm. Hard problems, e.g. satis¯ability of quanti¯ed Boolean formulae, can be solved in an efficient way deploying the massive parallelism of this paradigm. In this paper, we consider the prime factorization problem. We show an interval-valued algorithm that computes a proper divisor of the input number (or 1 in case the input is a prime). This interval-valued algorithm works in polynomial number of steps within this paradigm.en_US
dc.format.firstpage539en_US
dc.format.issue3-4en_US
dc.format.lastpage551en_US
dc.format.pages13en_US
dc.format.volume79en_US
dc.identifier.issn0033 - 3883
dc.identifier.urihttp://hdl.handle.net/123456789/67
dc.language.isoenen_US
dc.subjectmassively parallel computingen_US
dc.subjectinterval-valued computingen_US
dc.titlePrime factorization by interval-valued computingen_US
dc.title.journalPublicationes Mathematicae Debrecenen_US
dc.type.classArticleen_US
dc.type.specificationScientificen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
primeFactorization20111025final.pdf
Size:
132.02 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.57 KB
Format:
Item-specific license agreed upon to submission
Description: