Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
From MaRDI portal
Publication:3519896
DOI10.1142/S1230161208000158zbMath1144.81442MaRDI QIDQ3519896
Masanori Ohya, Satoshi Iriyama
Publication date: 19 August 2008
Published in: Open Systems & Information Dynamics (Search for Journal in Brave)
Related Items (4)
Computational complexity and applications of quantum algorithm ⋮ On Generalized Quantum Turing Machine and Its Applications ⋮ Language Classes Defined by Generalized Quantum Turing Machine ⋮ New quantum algorithm solving the NP complete problem
Cites Work
This page was built for publication: Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
