A quantifier characterization for nondeterministic log space
暂无分享,去创建一个
It is well known [C] that nondeterministic polynomial time computabilit y may be characterized in terms of deterministic polynomial time computabilit y as follows : A set A is in NP iff there exist a polynomial p and a deterministic polynomial time computable predicate R such tha t x A <--> (Ry )[I y l 5 P(Ixl ) (Vertical bars refer to the length of the enclosed string . ) This characterization provides a clean way to understand nondeterministi c time . It also provides a basis for the alternating quantifier hierarch y studied in [St], [SM] and [W] .
[1] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[2] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] Ivan Hal Sudborough,et al. On Tape-Bounded Complexity Classes and Multi-Head Finite Automata , 1973, SWAT.
[5] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.