Deterministic versus nondeterministic time and lower bound problems

@article{Stearns2003DeterministicVN,  title={Deterministic versus nondeterministic time and lower bound problems},  author={Richard Edwin Stearns},  journal={J. ACM},  year={2003},  volume={50},  pages={91-95},  url={https://api.semanticscholar.org/CorpusID:2194820}}
  • R. Stearns
  • Published inJACM2003
  • Computer Science, Mathematics
  • J. ACM
It is suggested that a study of generic problems might be a fruitful approach toward insights on such problems as how quickly a deterministic computing device can determine the outcome of a nondeterministic calculation.
3 Citations

3 Citations

Refining complexity analyses in planning by exploiting the exponential time hypothesis

This work presents results based on the exponential time hypothesis (ETH), which is a widely accepted hypothesis concerning the time complexity of 3-SAT, and provides, for instance, almost matching upper and lower bounds on theTime complexity of propositional planning.

Deterministic Adaptive Finite Automata

This work formally states the concept of determinism for adaptive finite-state automata, a class of adaptive devices that is particularly important for their relative simplicity.

11 References

The complexity of theorem-proving procedures

It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a…

Exploiting structure in quantified formulas

An Algebraic Model for Combinatorial Problems

The generalized satisfiability problem (GSP) model extends easily so as to apply to hierarchically specified problems and enables solutions to instances of such problems to be found directly from the specification rather than from the (often exponentially) larger specified object.

Reducibility Among Combinatorial Problems

    R. Karp
    Mathematics
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.

Satisfiability Is Quasilinear Complete in NQL

Many of the "exhausUve search" type problems such as satlsflablhty and colorabdlty are complete in NQL with respect to reductions that take O(n(log n) k) steps.

Power indices and easier hard problems

The concepts of power_index, satisfiability hypothesis (SH), and structure tree are introduced and used to make sharper hypotheses about a problem's complexity than “the problem isNP-complete.” These…

Turing Award lecture: it's time to reconsider time

hen I was a student, there was no such thing as comp u t e r s c i e n c e a n d m y i n t e r e s t s w e r e s t r i c t l y mathemat ics . I g r a d u a t e d f rom Car l ton College in 1958 with…

On the Computational Complexity of Algorithms

In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string.

Semiring-based constraint satisfaction and optimization

It is shown how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can beused also in newly defined schemes.

Related Papers

Showing 1 through 3 of 0 Related Papers