Titlebook: Advances in Algorithms, Languages, and Complexity; Ding-Zhu Du,Ker-I Ko Book 19971st edition Kluwer Academic Publishers 1997 algorithms.au

indices

S. J. Salon,J. M. Schneider,S. UdaWe consider sets that are high for the complexity class . with respect to several operators on complexity classes. The notion of lowness and highness in the context of complexity theory was introduced by Schüning [34] and further investigated and generalized under several aspects (see [24, 7, 9, 37, 22, 20, 27, 4, 31, 25, 26]).

温和女人

Lothar Gaul,Martin Kögl,Marcus WagnerIn recent years a number of conditions have been established that a monoid must necessarily satisfy if it is to have a presentation through some finite convergent string-rewriting system. Here we give a survey on this development, explaining these necessary conditions in detail and describing the relationships between them.

青石板

收到

Barrister

http://image.papertrans.cn/a/image/146653.jpg

murmur

Material Behaviour and Numerical Techniques,ics, and (3) allows for formal proofs. To that end we study clausal specifications over built-in algebras. To keep things simple, we consider built-in algebras only that are given as the initial model of a Horn clause specification. On top of this Horn clause specification new operators are (partial

放逐某人

Left-Atrium

Elliptic Boundary Integral Equations,retical computer science. In structural complexity theory, researchers have developed a reasonable framework for studying the complexity of these problems. In this paper, we survey how such investigation has proceeded, and explain the current status of our knowledge.

松紧带

流动才波动

W. Scott Dunbar,Don L. Andersonn conditions. We prove inclusion relations between the language families defined by grammars using, respectively, the weak and strong prefix- or equality-synchronized derivation mode. In particular, the weak BSCF languages are strictly included in the family of strong BSCF languages for both the pre