On the Ohya-Masuda quantum SAT algorithm
From MaRDI portal
Recommendations
- A Note on the Ohya-Masuda Quantum Algorithm
- Quantum algorithm for SAT problem andquantum mutual entropy
- Efficient algorithm for a quantum analogue of 2-SAT
- A parallel quantum algorithm for the satisfiability problem
- On efficiently solvable cases of quantum k-SAT
- On efficiently solvable cases of quantum \(k\)-SAT
- Computational Complexity of Quantum Satisfiability
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- scientific article; zbMATH DE number 6789292
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
Cited in
(8)- New quantum algorithm for studying NP-complete problems
- New quantum algorithm solving the NP complete problem
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
- Computational complexity and applications of quantum algorithm
- A Note on the Ohya-Masuda Quantum Algorithm
- scientific article; zbMATH DE number 6789292 (Why is no real title available?)
- Quantum algorithm for SAT problem andquantum mutual entropy
This page was built for publication: On the Ohya-Masuda quantum SAT algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707520)