Abstract
We review the quantum chaos algorithm solving the NP-complete problems in polynomial time. This work has been done in the series of papers with Professor Igor Volovich for nearly ten years.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: P-Adic Numbers, Ultrametric Analysis, and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.