Načítá se...
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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
National Academy of Sciences
1998
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC18139/ https://ncbi.nlm.nih.gov/pubmed/9419335 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|