Titlebook: Randomization and Approximation Techniques in Computer Science; International Worksh José Rolim Conference proceedings 1997 Springer-Verlag

figure

Approximation algorithms for covering polygons with squares and similar problems,uces a cover which is within an . approximation factor of the optimal, where . is the extremely slowly growing inverse of Ackermann‘s function. In parallel our algorithm runs in .(log . randomized time using .(max(. processors.

Observe

Hallowed

商品

油膏

陶器

MULTI

Weak and strong recognition by 2-way randomized automata,utomaton with .. states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.

Lipoma

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/r/image/821116.jpg

演讲

Foregery

978-3-540-63248-1Springer-Verlag Berlin Heidelberg 1997