Date: 2013-10-28 05:28 (UTC)
From: [identity profile] ircicq.livejournal.com
можно за полиномиальное время решать NP-полные задачи.

Это нет так. Класс задач, решаемых на квантовом компьютере BQP.
P <= BQP <= NP.

Известны NP задачи, не решаемые за полиномиальное время на QC.

This account has disabled anonymous posting.
If you don't have an account you can create one now.
HTML doesn't work in the subject.
More info about formatting

If you are unable to use this captcha for any reason, please contact us by email at support@dreamwidth.org

 
Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.