Question: Which of the following cannot be solved using polynomial time?

Options

A : Linear Programming

B : Greatest common divisor

C : Maximum matching

D : None of the mentioned

Click to view Correct Answer

Exam Quiz App on Google Play

Previous || Next

Deterministic Finite Automata-Introduction and Definition more questions

A generalization of P class can be:

Can a DFA recognize a palindrome number?

If the number of steps required to solve a problem....

The value of constants like p and e can be....

What does the following figure most correctly represents?^

Which of the following is not an example of finite....

Which of the following will not be accepted by the....

Which of the following will the given DFA won't accept?^

A CFG is ambiguous if

A CFG is not closed under

Ambiguous Grammar more Online Exam Quiz

Applications - Parsers

Applications of DFA

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols

Finding Patterns in Text,Algebric Laws and Derivatives

From Grammars to Push Down Automata

Node-Cover Problem, Hamilton Circuit Problem

Problem Solvable in Polynomial Time

Properties-Non Regular Languages