Pages that link to "Item:Q1422459"
From MaRDI portal
The following pages link to New quantum algorithm for studying NP-complete problems (Q1422459):
Displaying 13 items.
- Non-Kolmogorovian approach to the context-dependent systems breaking the classical probability law (Q365776) (← links)
- Computational complexity and applications of quantum algorithm (Q440659) (← links)
- Quantum algorithm for SAT problem andquantum mutual entropy (Q930728) (← links)
- Igor V. Volovich (Q1760300) (← links)
- New quantum algorithm solving the NP complete problem (Q1760321) (← links)
- Quantum binary search algorithm (Q2323771) (← links)
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device (Q2411545) (← links)
- Quantum mutual entropy defined by liftings (Q2430430) (← links)
- Quantum Information and Probability: My Collaboration with Professor Ingarden (Q3087510) (← links)
- On Quantum Algorithm for Binary Search and Its Computational Complexity (Q3459353) (← links)
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm (Q3519896) (← links)
- On Generalized Quantum Turing Machine and Its Applications (Q3558812) (← links)
- Language Classes Defined by Generalized Quantum Turing Machine (Q3567163) (← links)