𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New lower bounds for element distinctness on a one-tape Turing machine

✍ Scribed by Alejandro López-Ortiz

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
373 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

A new lower bound for the critical proba
A new lower bound for the critical probability of site percolation on the square lattice
✍ J. van den Berg; A. Ermakov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,