Titlebook: Structure in Complexity Theory; Proceedings of the C Alan L. Selman Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Arit

Euthyroid

An optimal lower bound for turing machines with one work tape and a two-way input tape, often called "offline 1-tape Turing machines"). In particular we prove an optimal lower bound of Ω(n./(log n).) for transposing a matrix with elements of bit length °(logn) (where n is the length of the total input). This implies a lower bound of Ω(n./(log n).) for sorting on the considered type of

躲債

證實(shí)

The polynomial hierarchy and intuitionistic Bounded Arithmetic,definable functions..The method of proof uses □.-realizability which is inspired by the recursive realizability of S.C. Kleene [3] and D. Nelson [5]. It also involves polynomial hierarchy functionals of finite type which are introduced in this paper.

運(yùn)動(dòng)性

The boolean hierarchy: Hardware over NP,classes. Some results present new ideas and techniques. Others put previous results about NP and D. in a richer perspective. Throughout, we emphasize the structure of the boolean hierarchy and its relations with more common classes.

遍及

Schlemms-Canal

An optimal lower bound for turing machines with one work tape and a two-way input tape, Turing machine. We also get as corollaries the first nonlinear lower bound for the most difficult version of the two tapes — versus — one problem, and a separation of the considered type of Turing machine from that with an additional write-only output tape.

flimsy

Probabilistic game automata,eterministically constructible and .(.)=Ω(.). The equality.(.(.))=.(.(.)) is due to Papadimitriou[9]. All the other inclusions above except one involve the simulation of one game by another. The exception is the result that .(.(.))?.(.(.)) which is shown byreducing a certain game theoretic problem to linear programming.

放牧

Resource-bounded Kolmogorov complexity of hard languages, descriptional complexity of Boolean circuits and formulas for hard languages. This result provides a classification of exponential-size circuits and formulas in terms of the amount of information contained in them.

Extort

1431-1917 implications of his philosophy for the social, economic, educational, and political structuring of the health care system.978-1-4612-7815-3978-1-4612-3150-9Series ISSN 1431-1917 Series E-ISSN 2197-3741

Arresting

Dominik Rupprecht,Rainer Blum,Karim Khakzarnsition from goal-oriented, incentive processes to automatic, habit-based responding. In the cortex, weak inhibitory control is a predisposing factor to, as well as a consequence of, repeated drug intake. However, these transitions are not absolute, and addiction can occur without a transition to ha