Prime factorization by interval-valued computing

dc.contributor.authorVályi, Sándor
dc.contributor.authorNagy, Benedek
dc.date.accessioned2012-06-05T11:27:49Z
dc.date.available2012-06-05T11:27:49Z
dc.date.conferenceend2010-10-08
dc.date.conferencestart2010-10-04
dc.date.issued2012-06-05
dc.descriptionWebcím: http://www.math.unideb.hu/nta2010/en_US
dc.description.abstractWe demonstrate that integer factorization is possible by the new massively parallel computing paradigm (interval-valued computing) in polynmial unumber of steps.en_US
dc.description.cityDebrecenen_US
dc.description.conferencetypeNationalen_US
dc.description.countryMagyarországen_US
dc.description.organizationDebreceni Egyetemen_US
dc.identifier.urihttp://hdl.handle.net/123456789/39
dc.language.isoenen_US
dc.subjectmassively parallel computingen_US
dc.subjectinterval-valued computingen_US
dc.titlePrime factorization by interval-valued computingen_US
dc.title.conferenceNumber theory and its applicationsen_US
dc.type.classLectureen_US
dc.type.specificationScientificen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Benedek_eloadasa_oktoberi_PethoA_konferencian_Prime010x.pdf
Size:
1.55 MB
Format:
Adobe Portable Document Format

License bundle

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