載入...

P/NP, and the quantum field computer

The central problem in computer science is the conjecture that two complexity classes, P (polynomial time) and NP (nondeterministic polynomial time—roughly those decision problems for which a proposed solution can be checked in polynomial time), are distinct in the standard Turing model of computati...

全面介紹

Na minha lista:
書目詳細資料
主要作者: Freedman, Michael H.
格式: Artigo
語言:Inglês
出版: National Academy of Sciences 1998
主題:
在線閱讀:https://ncbi.nlm.nih.gov/pmc/articles/PMC18139/
https://ncbi.nlm.nih.gov/pubmed/9419335
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!