Výsledky vyhledávání - "abstracts computational complexity for mathematical programming problems"

NP-hardness of deciding convexity of quartic polynomials and related problems Autor Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of…”
Získat plný text

Cyclic group blocking polyhedra Autor Shim, Sangho, Johnson, Ellis L.

“…Gomory (Linear Algebra Appl 2:451–558, 1969 ) gave a subadditive characterization of the facets of the group polyhedron. Although there are exponentially many…”
Získat plný text