scientific article; zbMATH DE number 4125012
From MaRDI portal
Publication:4205080
zbMath0686.68038MaRDI QIDQ4205080
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial hierarchyoracleslower bound resultscomplexity hierarchiesbounded Arthur-Merlin hierarchygeneralized Arthur-Merlin hierarchyprobabilistic polynomial hierarchy
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (2)
This page was built for publication: