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

只看該作者 · 發(fā)表于 2025-3-25 06:03:15

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.

只看該作者 · 發(fā)表于 2025-3-25 07:45:42

只看該作者 · 發(fā)表于 2025-3-25 14:21:15

只看該作者 · 發(fā)表于 2025-3-25 18:21:20

只看該作者 · 發(fā)表于 2025-3-25 22:03:45

只看該作者 · 發(fā)表于 2025-3-26 03:34:35

只看該作者 · 發(fā)表于 2025-3-26 05:55:16

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.

只看該作者 · 發(fā)表于 2025-3-26 12:08:34

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

只看該作者 · 發(fā)表于 2025-3-26 13:10:21

只看該作者 · 發(fā)表于 2025-3-26 18:42:18

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

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 07:06
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved