Home / Engineering / Theory of Computation / Question

M

#
Q.) Two persons X and Y have been asked to show that a certain problem p is NP-complete. X shows a polynomial time reduction from the 3-SAT problem to p and Y shows a polynomial time reduction from p to 3-SAT. From these reduction it can be inferred that

### Related MCQs on Theory of Computation

Q. The offset of a particular segment varies from :

Q. SYNC flooding attack belongs to a type of security attack known as ___________

Q. What is the result of cmp(3, 1)?

Q. An operating system version designed for use with a media center PC is Microsoft Windows XP

Q. In data warehousing what is time-variant data?

Q. A procedure that specifies finite set of steps is called

## Discusssion

Login to discuss.