A Characterization of NP Within Interval-Valued Computing

DOI10.1007/978-3-319-23111-2_11zbMath1415.68094OpenAlexW2208290573MaRDI QIDQ2945885

Sándor Vályi, Benedek Nagy

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23111-2_11

zbMATH Keywords

complexityunconventional computingNPcoNPinterval-valued computingdeterministic computing

Mathematics Subject Classification ID

Related Items (1)

Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines

Cites Work

• Optical computing
• The complexity of membership problems for circuits over sets of natural numbers
• Prime factorization by interval-valued computing
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Characterization of NP Within Interval-Valued Computing