A characterization of NP within interval-valued computing
From MaRDI portal
Recommendations
- A Shift-free Characterization of NP within Interval-valued Computing
- scientific article; zbMATH DE number 4049046
- Interval-valued computations and their connection with PSPACE
- Computation complexity of the range of a polynomial in several variables
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
Cites work
- Computing discrete logarithm by interval-valued paradigm
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 1615478 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Optical computing
- Prime factorization by interval-valued computing
- The complexity of membership problems for circuits over sets of natural numbers
Cited in
(4)- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- Interval-valued computations and their connection with PSPACE
- A Shift-free Characterization of NP within Interval-valued Computing
- Circular interval-valued computers and simulation of (red-green) Turing machines
This page was built for publication: A 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 Q2945885)