Prime factorization by interval-valued computing
| dc.contributor.author | Vályi, Sándor | |
| dc.contributor.author | Nagy, Benedek | |
| dc.date.accessioned | 2012-06-15T08:36:33Z | |
| dc.date.available | 2012-06-15T08:36:33Z | |
| dc.date.issued | 2012-06-15 | |
| dc.date.year | 2011 | |
| dc.description.abstract | Interval-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.firstpage | 539 | en_US |
| dc.format.issue | 3-4 | en_US |
| dc.format.lastpage | 551 | en_US |
| dc.format.pages | 13 | en_US |
| dc.format.volume | 79 | en_US |
| dc.identifier.issn | 0033 - 3883 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/67 | |
| dc.language.iso | en | en_US |
| dc.subject | massively parallel computing | en_US |
| dc.subject | interval-valued computing | en_US |
| dc.title | Prime factorization by interval-valued computing | en_US |
| dc.title.journal | Publicationes Mathematicae Debrecen | en_US |
| dc.type.class | Article | en_US |
| dc.type.specification | Scientific | en_US |