✦ LIBER ✦

Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines

✍ Scribed by Diehl, Scott; van Melkebeek, Dieter

Book ID: 118180701
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 312 KB
Volume: 36
Category: Article
ISSN: 0097-5397
DOI: 10.1137/050642228

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Proving Circuit Lower Bounds against

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy

✍ Cai, Jin-Yi; Watanabe, Osamu 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 298 KB

Theorems on the time hierarchy for rando

Theorems on the time hierarchy for random access machines

✍ A. G. Ivanov 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 612 KB

A lower time bound for the knapsack prob

A lower time bound for the knapsack problem on random access machines

✍ Peter Klein; Friedhelm Meyer Heide 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi

Time--Space Lower Bounds for Directed st

Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models

✍ Barnes, Greg; Edmonds, Jeff A. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 300 KB

With probability one, a random oracle se

With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy

✍ Jin-Yi Cai 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 992 KB

On the equivalence of the max-min transp

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

✍ Yunpeng Pan; Leyuan Shi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 220 KB