✦ LIBER ✦

A tight lower bound for the complexity of path-planning for a disc

✍ Scribed by Colm Ó'Dúnlaing

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight amortized bound for path reversa

✍ David Ginat; Daniel D Sleator; Robert E Tarjan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 KB

A tight lower bound for optimal bin pack

✍ Heng-Yi Chao; Mary P. Harper; Russell W. Quong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A tight lower bound for restricted pir p

✍ Richard Beigel; Lance Fortnow; William Gasarch 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 140 KB

A tight lower bound for the train revers

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A Lower Bound for the Shortest Path Prob

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A tight lower bound for the completion t

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB