THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
From MaRDI portal
Publication:4291544
DOI10.1142/S0129054193000195zbMath0804.68052OpenAlexW2004815025MaRDI QIDQ4291544
Heribert Vollmer, Klaus W. Wagner
Publication date: 12 January 1995
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054193000195
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
A note on SpanP functions ⋮ UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS ⋮ The operators min and max on the polynomial hierarchy ⋮ ON HIGHER ARTHUR-MERLIN CLASSES ⋮ SELF-SPECIFYING MACHINES ⋮ THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY ⋮ A note on unambiguous function classes
This page was built for publication: THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
