Tuesday, 12 May 2015

Q31,paper 3,j12 . The upper bound of computing time of m coloring decision problem is


Options (A) O(nm) (B) O(n^m) (C) O(nm^n) (D) O(n^mm^n)
Answer(C) O(nm^n)
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)