scientific article; zbMATH DE number 512802

zbMath0794.68059MaRDI QIDQ4281495

Jozef Vyskoč, Jin-Yi Cai, Hemaspaandra, Lane A.

Publication date: 31 August 1994

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

zbMATH Keywords

complexity classesprobabilistic computationunambiguous computationfault-tolerant database access

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

Revisiting a result of Ko ⋮ A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes ⋮ On helping by parity-like languages ⋮ On resource-bounded instance complexity ⋮ Query-monotonic Turing reductions ⋮ Fault-tolerance and complexity (Extended abstract) ⋮ A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. ⋮ On the probabilistic closure of the loose unambiguous hierarchy ⋮ Quantum computing and quadratically signed weight enumerators

This page was built for publication: