Loading...
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:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
National Academy of Sciences
1998
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC18139/ https://ncbi.nlm.nih.gov/pubmed/9419335 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|