Reductions and Query Complexity

Tools for comparing the difficulty of problems. It covers reductions that preserve the quality of approximate solutions between optimization problems, and problems whose difficulty is measured by how many questions an algorithm must ask about its input. An entry belongs here when it is mainly used to prove hardness or lower bounds. It excludes the algorithms that solve the problems, which belong to the subcategories of their problem type, and the complexity classes.