An Algebraic Theory of Complexity for Discrete Optimization

Abstract

Discrete optimization problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimized can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete… (More)
DOI: 10.1137/130906398

Topics

1 Figure or Table

Statistics

02040201520162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Cohen2013AnAT, title={An Algebraic Theory of Complexity for Discrete Optimization}, author={David A. Cohen and Martin C. Cooper and P{\'a}id{\'i} Creed and Peter Jeavons and Stanislav Zivny}, journal={SIAM J. Comput.}, year={2013}, volume={42}, pages={1915-1939} }