Titlebook: STACS 92; 9th Annual Symposium Alain Finkel,Matthias Jantzen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Automat.alg

Lucubrate

誓言

debble

Axiomatizations of backtracking,y are restricted to have . behaviours, there are finite complete axiomatizations that can be used to decide the equivalence of goal schemes. We conjecture that there is no such finite axiomatization in the case of ..

pantomime

RACE

hematuria

The parallel complexity of tree embedding problems (extended abstract),rmining whether or not a tree with a degree constraint is a minor of a general tree. These algorithms are two examples of a general technique that can be used for solving other problems on trees. One by-product of this technique is an . reduction of tree problems to matching problems.

砍伐

Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition,itrarily small constant α<1, where T(n) is the work of the best known sequential algorithm for the problem. This reduces substantially the gap between the total work of sublinear time parallel algorithms and that of the best known sequential algorithms.

gnarled

Infant

obsolete