Titlebook: STACS 94; 11th Annual Symposiu Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner Conference proceedings 1994 Springer-Verlag Berlin Heidelber

發(fā)酵

Quasilinear time complexity theory,l properties of the polynomial-time hierarchy carry over to the quasilineartime hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-correcting codes that runs in quasilinear time. We show,

重畫只能放棄

Space-efficient deterministic simulation of probabilistic automata,ngth ., we ask how much space does a deterministic Turing machine need in order to decide the acceptance of an input string by that automaton?.The question is interesting even in the case of one-head one-way probabilistic finite automata. We call (rational) . (S.) the class of languages recognized b

Carminative

Reachability and the power of local ordering,tructures expressible in first-order logic augmented with the appropriate Transitive Closure operator [I87]: Over ordered structures, (FO + DTC) captures L and (FO + TC) captures NL. On the other hand, in the absence of ordering, (FO + TC) is strictly more powerful than (FO + DTC) [GM92]. An apparen

Ejaculate

groggy

Inscrutable

不理會(huì)

Combination of matching algorithms,der which conditions matching algorithms in the single theories are sufficient to obtain a matching algorithm in the combination? In general, the blind use of combination techniques introduces unification. Two different restrictions are considered in order to reduce this unification to matching. Fir

Breach

作嘔

Optimal pattern matching on meshes,put text is a string of . symbols placed in a √.×√. mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time .(√n) is presented. It applies a novel technique to design parallel pattern-matching algorithms b

neutralize