Skip to main content
Vahan's user avatar
Vahan's user avatar
Vahan's user avatar
Vahan
  • Member for 12 years, 1 month
  • Last seen more than 1 year ago
  • London, United Kingdom
answered
Loading…
awarded
awarded
revised
Loading…
comment
comment
Is unconstrained integer convex optimization problem NP-hard?
F:Z^N -> R and assume there is a oracle giving the value of F(x) for each integral x.
awarded
comment
Is unconstrained integer convex optimization problem NP-hard?
F is an arbitrary convex function, doesn't have to be smooth. I guess the only input is F, but I'm interested in a general result for any convex F.
Loading…