✦ LIBER ✦

Automated proofs of upper bounds on the running time of splitting algorithms

✍ Scribed by S. S. Fedin; A. S. Kulikov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponential bounds for the running time

✍ Luc Devroye 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Upper bound on the lengthening of proofs

✍ V. P. Orevkov 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 689 KB

Automated conjectures on upper bounds fo

✍ V. Brankov; P. Hansen; D. Stevanović 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 191 KB

An upper bound on the expected completio

✍ Jerzy Kamburowski 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 796 KB

An upper bound on the time complexity of

✍ Brian G. Patrick; Mohammed Almulla; Monroe M. Newborn 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 704 KB

On the impossibility of explicit upper b

✍ Andre Scedrov 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 446 KB