An Algebraic Theory of Complexity for Discrete Optimization

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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 42; číslo 5; s. 1915 - 1939
Hlavní autoři:	Cohen, David A., Cooper, Martin C., Creed, Páidí, Jeavons, Peter G., Živný, Stanislav
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Témata:	Algebra Applied mathematics Artificial Intelligence Boolean Cloning Computation and Language Computer Science Integer programming International conferences Language Logic in Computer Science Machine Learning Optimization Polymorphism Scholarships & fellowships Values Weighted Polymorphisms Galois Connection Valued Constraint Satisfaction Problems Constraint Optimization Discrete Optimization Weighted Clones
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!