✦ LIBER ✦

Quantificational variants on the halting problem for turing machines

✍ Scribed by Patrick C. Fischer

Publisher: John Wiley and Sons
Year: 1969
Tongue: English
Weight: 469 KB
Volume: 15
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19690151302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The element distinctness problem on one-

The element distinctness problem on one-tape Turing machines

✍ Andrzej Szepietowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 349 KB

A PTAS for the average weighted completi

A PTAS for the average weighted completion time problem on unrelated machines

✍ Foto Afrati; Evripidis Bampis; Claire Kenyon; Ioannis Milis 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 95 KB 👁 2 views

A dynamic programming formulation for th

A dynamic programming formulation for the one machine sequencing problem

✍ P.J. Weeda 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 222 KB

A note on the load balancing problem for

A note on the load balancing problem for coarse grained hypercube dictionary machines

✍ Frank Dehne; Michel Gastaldo 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On strongly polynomial variants of the n

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Lower Bounds for the Union–Find and the

Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines

✍ Han La Poutré 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In