The choice of polynomial class has led to the development of an extensive theory called

Related MCQs

• A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
•                    is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
• The worst-case efficiency of solving a problem in polynomial time is?
• Problems that can be solved in polynomial time are known as?
• To which class does the Euler’s circuit problem belong?
• To which of the following class does a CNF-satisfiability problem belong?
• Every graph has only one minimum spanning tree.
• Consider a complete graph G with 4 vertices. The graph G has          spanning trees.
• Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
• Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.