標(biāo)題: Titlebook: Randomization and Approximation Techniques in Computer Science; International Worksh José Rolim Conference proceedings 1997 Springer-Verlag [打印本頁(yè)] 作者: HARDY 時(shí)間: 2025-3-21 17:55
書目名稱Randomization and Approximation Techniques in Computer Science影響因子(影響力)
書目名稱Randomization and Approximation Techniques in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Randomization and Approximation Techniques in Computer Science網(wǎng)絡(luò)公開(kāi)度
書目名稱Randomization and Approximation Techniques in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Randomization and Approximation Techniques in Computer Science被引頻次
書目名稱Randomization and Approximation Techniques in Computer Science被引頻次學(xué)科排名
書目名稱Randomization and Approximation Techniques in Computer Science年度引用
書目名稱Randomization and Approximation Techniques in Computer Science年度引用學(xué)科排名
書目名稱Randomization and Approximation Techniques in Computer Science讀者反饋
書目名稱Randomization and Approximation Techniques in Computer Science讀者反饋學(xué)科排名
作者: NOCT 時(shí)間: 2025-3-21 21:06
Approximation algorithms for covering polygons with squares and similar problems,ust lie entirely within the polygon. Let . be an arbitrary input polygon, with . vertices, coverable by squares. Let . denote the minimum number of squares required to cover .. In the first part of this paper we present an algorithm which guarantees a constant (14) approximation factor running in ..作者: Eclampsia 時(shí)間: 2025-3-22 02:58
A combinatorial consistency lemma with application to proving the PCP theorem,egree tests. Here, we refer to the difficulty of obtaining . results regarding low-degree tests; namely, results of the type obtained and used by Arora and Safra and Arora et. al..In this paper, we eliminate the need to obtain such strong results on low-degree tests when proving the PCP Theorem. Alt作者: 抓住他投降 時(shí)間: 2025-3-22 05:11
Super-bits, demi-bits, and ,-natural proofs,l tests. This new kind of pseudo-randomness rules out the existence of .-natural properties that can work against .. This is an important extension of the original theory of .-natural proofs [10]. We also introduce the closely related demi-bit conjecture which is more intuitive and is the source of 作者: Ataxia 時(shí)間: 2025-3-22 10:52 作者: Serenity 時(shí)間: 2025-3-22 13:26
Random-based scheduling new approximations and LP lower bounds,erage performance optimization. The general constrained one-machine scheduling problem to minimize the average weighted completion time not only captures these features, but also is an important building block for more complex problems involving multiple machines..In this context, the conversion of 作者: 討好美人 時(shí)間: 2025-3-22 17:04 作者: chiropractor 時(shí)間: 2025-3-22 22:37
Probabilistic approximation of some NP optimization problems by finite-state machines,t with probability tending to 1 as the number of input items tends to infinity, the problem is approximable up to any given constant factor ε > 0 by a finite-state machine. More precisely, let . be a problem in our subclass of NP optimization problems, and let . be an input represented by a sequence作者: ABOUT 時(shí)間: 2025-3-23 03:16 作者: 觀點(diǎn) 時(shí)間: 2025-3-23 05:35 作者: 焦慮 時(shí)間: 2025-3-23 11:43
Tally languages accepted by Monte Carlo pushdown automata,phabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that l作者: 諂媚于人 時(shí)間: 2025-3-23 15:29 作者: SMART 時(shí)間: 2025-3-23 20:50
Randomness, stochasticity and approximations,h sets have optimal unsafe approximations has been investigated extensively, see, e.g., [1, 5, 15, 16]. Recently, Wang [15, 16] showed that polynomial time random sets are neither optimally unsafe approximable nor .-levelable. In this paper, we will show that: (1) There exists a polynomial time stoc作者: 自傳 時(shí)間: 2025-3-24 01:15
Probabilistic approximation of some NP optimization problems by finite-state machines, of n independent identically distributed random variables with a fixed distribution. Then for any ε > 0 there exists a finite-state machine which does the following: On a random input . the finite-state machine produces a feasible solution whose objective value . satisfies.when . is large enough. Here . and . are positive constants.作者: 格子架 時(shí)間: 2025-3-24 05:58 作者: overwrought 時(shí)間: 2025-3-24 10:26 作者: affluent 時(shí)間: 2025-3-24 11:22
0302-9743 ce, RANDOM‘97, held as a satelite meeting of ICALP‘97, in Bologna, Italy, in July 1997..The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arisi作者: 火花 時(shí)間: 2025-3-24 17:23
Conference proceedings 1997‘97, held as a satelite meeting of ICALP‘97, in Bologna, Italy, in July 1997..The volume presents 14 thoroughly revised full papers selected from 37 submissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the 作者: 自然環(huán)境 時(shí)間: 2025-3-24 21:15
Conference proceedings 1997ubmissions; also included are four invited contributions by leading researchers. The book focuses on algorithms and complexity aspects arising in the development of efficient randomized solutions to computationally difficult problems. The papers are organized in sections on approximation, randomness, algorithms, and complexity.作者: 大漩渦 時(shí)間: 2025-3-25 00:08
A combinatorial consistency lemma with application to proving the PCP theorem,degree tests (which yields weaker bounds). In other words, we replace the strong algebraic analysis of low-degree tests presented by Arora and Safra and Arora et. al. by a combinatorial lemma (which does not refer to low-degree tests or polynomials).作者: figure 時(shí)間: 2025-3-25 06:03
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 時(shí)間: 2025-3-25 07:45 作者: Hallowed 時(shí)間: 2025-3-25 14:21 作者: 商品 時(shí)間: 2025-3-25 18:21 作者: 油膏 時(shí)間: 2025-3-25 22:03 作者: 陶器 時(shí)間: 2025-3-26 03:34 作者: MULTI 時(shí)間: 2025-3-26 05:55
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 時(shí)間: 2025-3-26 12:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/r/image/821116.jpg作者: 演講 時(shí)間: 2025-3-26 13:10 作者: Foregery 時(shí)間: 2025-3-26 18:42
978-3-540-63248-1Springer-Verlag Berlin Heidelberg 1997作者: 放逐 時(shí)間: 2025-3-27 00:46 作者: plasma 時(shí)間: 2025-3-27 04:43 作者: Fsh238 時(shí)間: 2025-3-27 05:45 作者: Terminal 時(shí)間: 2025-3-27 12:40 作者: 天空 時(shí)間: 2025-3-27 16:11 作者: 赤字 時(shí)間: 2025-3-27 20:01 作者: coagulation 時(shí)間: 2025-3-28 00:28 作者: Overthrow 時(shí)間: 2025-3-28 02:17 作者: 背帶 時(shí)間: 2025-3-28 06:21 作者: Mettle 時(shí)間: 2025-3-28 13:30
Oded Goldreich,Shmuel Safra needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to receive seminal contributions from the leaders in the field and at978-1-4899-7475-4作者: Firefly 時(shí)間: 2025-3-28 14:53 作者: 阻礙 時(shí)間: 2025-3-28 22:02
P. Crescenzi,V. Kann needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to receive seminal contributions from the leaders in the field and at978-1-4899-7475-4作者: 慢跑 時(shí)間: 2025-3-28 23:49
Andreas S. Schulz,Martin Skutella needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to receive seminal contributions from the leaders in the field and at978-1-4899-7475-4作者: 針葉 時(shí)間: 2025-3-29 03:36 作者: Trabeculoplasty 時(shí)間: 2025-3-29 09:18
Russell Impagliazzo needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to gather seminal contributions from the leaders in the field, and at978-1-4899-7478-5作者: 從容 時(shí)間: 2025-3-29 14:52 作者: 鞏固 時(shí)間: 2025-3-29 16:02
Jānis Ka?eps,Dainis Geidmanis,Rūsi?? Freivalds needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to gather seminal contributions from the leaders in the field, and at978-1-4899-7478-5作者: 兇殘 時(shí)間: 2025-3-29 21:28 作者: surrogate 時(shí)間: 2025-3-30 03:16 作者: 相互影響 時(shí)間: 2025-3-30 07:59
Marek Karpinskive with large common datasets available to the scientific community. A concerted effort is needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to receive seminal contributions from the leaders in the field and at作者: precede 時(shí)間: 2025-3-30 11:55
Sanjeev Arorave with large common datasets available to the scientific community. A concerted effort is needed tocollate all this information in a centralized place. By having all the information in an Encyclopedia form, we have an opportunity to receive seminal contributions from the leaders in the field and at作者: 遺棄 時(shí)間: 2025-3-30 15:44 作者: foppish 時(shí)間: 2025-3-30 16:55 作者: 神化怪物 時(shí)間: 2025-3-30 22:51 作者: dandruff 時(shí)間: 2025-3-31 02:24 作者: 會(huì)犯錯(cuò)誤 時(shí)間: 2025-3-31 08:25 作者: implore 時(shí)間: 2025-3-31 09:36 作者: IRS 時(shí)間: 2025-3-31 15:27
Randomness, stochasticity and approximations,stic sequence, we can find an optimal betting strategy (prediction function) such that we will never lose our own money (except the money we have earned), that is to say, if at the beginning we have only one dollar and we always bet one dollar that the next selected bit is 1, then we always have eno作者: Ptosis 時(shí)間: 2025-3-31 19:11
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems,作者: Engulf 時(shí)間: 2025-3-31 23:20
Randomization and Approximation Techniques in Computer ScienceInternational Worksh
