Computing discrete logarithm by interval-valued paradigm

MaRDI QIDQ4994844zbMATH OpenFDO

Authors Benedek Nagy, Sándor Vályi

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1404.0078, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2012.7

Mathematics Subject Classification ID

Data structures (68P05) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Prime factorization by interval-valued computing
• A Shift-free Characterization of NP within Interval-valued Computing
• Interval-valued computations without the product operator
• Computing discrete logarithms in an interval
• Circular interval-valued computers and simulation of (red-green) Turing machines

Cited in

(7)

• An extension of interval-valued computing equivalent to red-green Turing machines
• Prime factorization by interval-valued computing
• A characterization of NP within interval-valued computing
• scientific article; zbMATH DE number 1113850 (Why is no real title available?)
• Computing discrete logarithms in an interval
• Circular interval-valued computers and simulation of (red-green) Turing machines
• Interval-valued computations without the product operator

This page was built for publication: Computing discrete logarithm by interval-valued paradigm

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