Define tractable and intractable problems, Data Structure & Algorithms

Define tractable and intractable problems

Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are known as intractable problems.

 

Posted Date: 7/27/2013 6:24:44 AM | Location : United States







Related Discussions:- Define tractable and intractable problems, Assignment Help, Ask Question on Define tractable and intractable problems, Get Answer, Expert's Help, Define tractable and intractable problems Discussions

Write discussion on Define tractable and intractable problems
Your posts are moderated
Related Questions
QUESTION (a) Construct a binary tree for the following numbers assuming that a number greater than the node (starting from the root) goes to the left else it goes to the right.


Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, o

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

How branching takes place in Instruction pipeline. Explain with suitable examples

Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Q. Show the various passes of bubble sort on the unsorted given list 11, 15, 2, 13, 6           Ans: The given data is as follows:- Pass 1:-     11   15   2     13

Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know