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...

Full description

Saved in:
Bibliographic Details
Main Author: Freedman, Michael H.
Format: Artigo
Language:Inglês
Published: National Academy of Sciences 1998
Subjects:
Online Access:https://ncbi.nlm.nih.gov/pmc/articles/PMC18139/
https://ncbi.nlm.nih.gov/pubmed/9419335
Tags: Add Tag
No Tags, Be the first to tag this record!