Wordt geladen...
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...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
National Academy of Sciences
1998
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC18139/ https://ncbi.nlm.nih.gov/pubmed/9419335 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|