A Shift-free Characterization of NP within Interval-valued Computing

DOI10.3233/FI-2017-1581MaRDI QIDQ4601153zbMATH OpenFDO

Authors Benedek Nagy, Sándor Vályi

Publication date 19 January 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

complexityunconventional computingNPmassive parallelismcoNPinterval-valued computingnew computing paradigmsdeterministic computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A characterization of NP within interval-valued computing
• A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
• An inductive number-theoretic characterization of NP
• scientific article; zbMATH DE number 4115977
• An extension of interval-valued computing equivalent to red-green Turing machines
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Publication:4885384
• Parametrised second-order complexity theory with applications to the study of interval computation
• scientific article; zbMATH DE number 4049046
• On relativized nondeterministic polynomial-time bounded computations

Cited in

(6)

• Circular interval-valued computers and simulation of (red-green) Turing machines
• Prime factorization by interval-valued computing
• A characterization of NP within interval-valued computing
• Interval-valued computations without the product operator
• An extension of interval-valued computing equivalent to red-green Turing machines
• Computing discrete logarithm by interval-valued paradigm

This page was built for publication: A Shift-free Characterization of NP within Interval-valued Computing

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