Interval-valued computations and their connection with PSPACE
DOI10.1016/J.TCS.2007.12.013zbMATH Open1136.68024OpenAlexW2070955516MaRDI QIDQ2482463FDOQ2482463
Authors: Benedek Nagy, Sándor Vályi 
Publication date: 16 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.013
Recommendations
- Interval computations and their categorification
- A characterization of NP within interval-valued computing
- Interval-valued Iq^b-calculus and applications
- Interval Space Representation of interval Structures
- Interval-Valued Intuitionistic Multiplicative Sets
- Interval-valued intuitionistic sets and their application to topology
- Complexity of interpolation and related problems in positive calculi
- Publication:4885383
- scientific article; zbMATH DE number 808820
- Computable structures and operations on the space of continuous functions
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Maintaining knowledge about temporal intervals
- An optical model of computation
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Non-Turing computations via Malament--Hogarth space-times
- Title not available (Why is that?)
- Analog computation via neural networks
- Title not available (Why is that?)
- The CNN universal machine: an analogic array computer
- SOFSEM 2006: Theory and Practice of Computer Science
Cited In (6)
- A characterization of NP within interval-valued computing
- Prime factorization by interval-valued computing
- Non-isometric contextual array grammars with regular control and local selectors
- Interval-valued computations without the product operator
- An extension of interval-valued computing equivalent to red-green Turing machines
- Circular interval-valued computers and simulation of (red-green) Turing machines
This page was built for publication: Interval-valued computations and their connection with PSPACE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482463)
