THE COMPLEXITY OF FINDING MIDDLE ELEMENTS

DOI10.1142/S0129054193000195MaRDI QIDQ4291544zbMATH OpenOpenAlexFDO

Authors Heribert Vollmer, K. 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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The power of the middle bit of a \(\#\)P function
• Complexity classes of optimization functions
• A complexity theory for feasible closure properties
• scientific article; zbMATH DE number 1953880

Cited in

(8)

• A note on SpanP functions
• A note on unambiguous function classes
• The power of the middle bit of a \(\#\)P function
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
• The operators min and max on the polynomial hierarchy
• SELF-SPECIFYING MACHINES
• The operators min and max on the polynomial hierarchy
• ON HIGHER ARTHUR-MERLIN CLASSES

This page was built for publication: THE COMPLEXITY OF FINDING MIDDLE ELEMENTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291544)