Complexity classes of optimization functions

DOI10.1006/inco.1995.1109zbMath0835.68048OpenAlexW2052582609MaRDI QIDQ1898460

Klaus W. Wagner, Heribert Vollmer

Publication date: 16 April 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/35b34374eef8b25ac764d9d01bbff8d129cc5fe7

zbMATH Keywords

complexity classes\(p\)-founded class of optimization functions

Mathematics Subject Classification ID

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

Related Items (9)

UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS ⋮ The operators min and max on the polynomial hierarchy ⋮ Weighted Boolean Formula Games ⋮ Recursion theoretic characterizations of complexity classes of counting functions ⋮ Optimal satisfiability for propositional calculi and constraint satisfaction problems. ⋮ ON HIGHER ARTHUR-MERLIN CLASSES ⋮ THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY ⋮ On the Complexity of Inverse Mixed Integer Linear Optimization ⋮ A note on unambiguous function classes

This page was built for publication: Complexity classes of optimization functions