> 2011/9/7, Simon Perreault <[email protected]>: >> [email protected] wrote, on 09/07/2011 03:28 AM: >>> What I have done is I clarified the text as follows: >>> >>> " >>> o Complexity: Reflects the complexity level of understanding the >>> algorithm and the expected complexity to configure an >>> implementation. >>> " >> >> A subjective criteria is not very useful for comparing algorithms.
Complexity analysis is quite known in fact. There is space complexity and time complexity, maybe here we are talking about time complexity. The algorithm could be exponential which is not desired. A linear algorithm is ideal but difficult to get. Logarithmic algorithm is usually the compromise. All you need to do is to express the computations involved in some algorithmic form and then analyze. Sounds familiar? Behcet > > +1 > >> Here's a suggestion: configuration complexity could be measured in > terms of >> the >> number of parameters necessary. This is an objective criteria. > > Criteria should be as objective as possible, especially for "Guessing > Complexity of a Valid Port" .... > Not sure whether there are some mathematical guidance could help to > evaluate computational complexity? Maybe time complexity is a > candidate > > BRs > > Gang > _______________________________________________ > Softwires mailing list > [email protected] > https://www.ietf.org/mailman/listinfo/softwires > _______________________________________________ Softwires mailing list [email protected] https://www.ietf.org/mailman/listinfo/softwires
