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

Ask an Expert

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

Write your message here..

Related Questions

Data Mining and Neural Networks, I am looking for some help with a data min... I am looking for some help with a data mining class with questions that are about neural networks and decision trees. Can you help? I can send document with questions.

Function overloading, program on function loading program on function loading

Stacks, Q. Explain w hat are the stacks? How can we use the stacks  to chec... Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

Explain merge sort, Merge sort: Merge sort is a sorting algorithm that ... Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

Binary search, Explain binary search with an example Explain binary search with an example

Binary search tree, A binary search tree (BST), which may sometimes also be... A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

State hsv colour model, HSV Colour Model Instead of a set of colour pri... HSV Colour Model Instead of a set of colour primaries, the HSV model uses colour descriptions that have a more intuitive appeal to a user. To give a colour specification, a use

Homework, Write a recursive function the computes the number of digits in a... Write a recursive function the computes the number of digits in a positive integer n. For example if n = 6598, the function should return 4. Find a variant expression and a thresho

Branch and Bound method, give some examples of least cost branch and bound ... give some examples of least cost branch and bound method..

Basic organization of computer system, what happen''s in my computer when ... what happen''s in my computer when i input any passage