PP-lowness and a simple definition of AWPP
From MaRDI portal
Publication:1405795
DOI10.1007/s00224-002-1089-8zbMath1062.68060OpenAlexW2065701647MaRDI QIDQ1405795
Publication date: 26 August 2003
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-002-1089-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
An oracle builder's toolkit ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ Computation in generalised probabilisitic theories ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties ⋮ LWPP and WPP are not uniformly gap-definable ⋮ Graph Isomorphism is in SPP ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Error-bounded probabilistic computations between MA and AM ⋮ Rectangles Are Nonnegative Juntas ⋮ Gröbner bases for finite-temperature quantum computing and their complexity
This page was built for publication: PP-lowness and a simple definition of AWPP
