Prime factorization by interval-valued computing

DOI10.5486/PMD.2011.5134MaRDI QIDQ2898857zbMATH OpenFDO

Authors Benedek Nagy, Sándor Vályi

Publication date 12 July 2012

Published in Publicationes Mathematicae Debrecen (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5486/PMD.2011.5134

zbMATH Keywords

factorizationinterval-valued computingunconventional computing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Computing discrete logarithm by interval-valued paradigm
• A Shift-free Characterization of NP within Interval-valued Computing
• Interval-valued computations without the product operator
• Computing prime divisors in an interval
• Interval-valued computations and their connection with PSPACE

Cited in

(5)

• A characterization of NP within interval-valued computing
• Computing discrete logarithm by interval-valued paradigm
• Circular interval-valued computers and simulation of (red-green) Turing machines
• Computing prime divisors in an interval
• Interval-valued computations without the product operator

This page was built for publication: Prime factorization by interval-valued computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898857)