✦ LIBER ✦

Some Results on Derandomization

✍ Scribed by Harry Buhrman; Lance Fortnow; A. Pavan

Publisher: Springer
Year: 2004
Tongue: English
Weight: 214 KB
Volume: 38
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-004-1194-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Derandomization in Computational Geometr

Derandomization in Computational Geometry

✍ Jiřı&#x0301; Matoušek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.

Derandomized graph products

✍ Noga Alon; Uriel Feige; Avi Wigderson; David Zuckerman 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 915 KB

Some results on gaps

✍ Zoran Spasojević 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 776 KB

On some resultant identities

✍ N. Kravitsky; Z. Waksman 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 850 KB

Some results on generalized exponents

✍ Neufeld, Stewart; Shen, Jian 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u ∈ V , denoted exp(u), is the least integer k such that there is a u →

Some results on linear arboricity

✍ Filip Guldan 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB