Access Restriction

Author Stearns, Richard E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Computational complexity ♦ NP-completeness ♦ SAT ♦ Generic algorithms ♦ Generic problems ♦ Nondeterminism ♦ Power index ♦ Time complexity
Abstract Because many problems of general interest have natural nondeterministic algorithms and because computers act deterministically, it is important to understand the relationship between deterministic and nondeterministic time. Specifically, it is important to understand how quickly a deterministic computing device can determine the outcome of a nondeterministic calculation. So far, we have no general techniques that work any better than trying all step-by-step simulations, an exponential method.The most famous question concerning determinism versus nondeterminism is the P = NP question. However, this is a different question than "what is the relationship?" and it is possible that significant progress about the relationship can be achieved without answering the Pv = NP question. Thanks to efficient reductions from Turing machine simulation to SAT, the relationship question can be posed as a question about SAT. The problem of proving a nontrivial lower bound on the time required to solve SAT is just an instance of the larger problem of proving lower bounds for any natural problem. It is suggested that a study of generic problems might be a fruitful approach toward insights on such problems.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 50
Issue Number 1
Page Count 5
Starting Page 91
Ending Page 95

Open content in new tab

   Open content in new tab
Source: ACM Digital Library