IIIT-Delhi Institutional Repository

Browsing Year-2018 by Subject "Complexity"

Browsing Year-2018 by Subject "Complexity"

Sort by: Order: Results:

  • Goswami, Shubham; Arora, Chetan (Advisor) (IIIT-Delhi, 2017-11-17)
    Sum of submodular function minimization is a combinatorial optimization problem(NP-Hard), We begin with the Submodular function minimization and extending it to Sum of submodular function(SOS), there are different ...

Search Repository

Advanced Search


My Account