Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » discretemath

Topic: Complexity of multi-minimizer minimization
Replies: 2   Last Post: Mar 19, 2011 10:41 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Yuly Shipilevsky

Posts: 17
Registered: 1/25/05
Complexity of multi-minimizer minimization
Posted: Mar 18, 2011 4:41 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

If somebody has an experience in minimization where the problem has multiple minimizers.

1. Is it necessary to re-run the same subroutine to find next minimizer and so on, until
all minimizers will be computed(one re-run - one minimizer)?
If so, is it necessary to use as an input for the next re-run, minimizers, computed at
the previous re-runs?

2. As a rule, the complexity of minimization is being evaluated per one minimizer.
If per one minimizer its polynomial-time, what can we say about
total complexity?

Thanks.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.