scientific article; zbMATH DE number 1318518

zbMath0925.68183MaRDI QIDQ4256650

Homer, Steven, Harry Buhrman

Publication date: 8 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (11)

In search of an easy witness: Exponential time vs. probabilistic polynomial time. ⋮ The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory ⋮ The power of natural properties as oracles ⋮ Unnamed Item ⋮ Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Unnamed Item ⋮ Efficient learning algorithms yield circuit lower bounds ⋮ Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds ⋮ Unnamed Item ⋮ On some FPT problems without polynomial Turing compressions

This page was built for publication: