NP Complete/ NP hard problems

User Name:

Password:

Remember me

The Shed is going Social! Join us on FaceBook and Twitter and chime in on the conversation.
		Dev Shed Forums > Programming Languages - More > Software Design
NP Complete/ NP hard problems Discuss NP Complete/ NP hard problems in the Software Design forum on Dev Shed. NP Complete/ NP hard problems Software design forum discussing design principles and non-language specific algorithms. Get help with logic, algebraic, or relational concepts.

Add This Thread To:

Del.icio.us

Digg

Google

Spurl

Blink

Furl

Simpy

Y! MyWeb

« Previous Thread | Next Thread »

Thread Tools

Search this Thread

Rate Thread

Display Modes

Dev Shed Forums Sponsor:

May 18th, 2003, 07:03 PM

fares

Junior Member

Join Date: May 2003

Posts: 3

Time spent in forums: < 1 sec
Reputation Power: 0

NP Complete/ NP hard problems

This is another question am facing trouble with it.

List three NP Complete/ NP hard problems. Explain how they can be solved using a brute force approach and give the time complexity . what are possible strategies to improve their abysmal time efficiency ?

How can NP completeness differs from NP Hardness ?

Viewing: Dev Shed Forums > Programming Languages - More > Software Design > NP Complete/ NP hard problems

« Previous Thread | Next Thread »

Developer Shed Advertisers and Affiliates

Thread Tools	Search this Thread
Email this Page	Search this Thread: Advanced Search
Display Modes	Rate This Thread
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode	Rate This Thread:

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts vB code is On Smilies are On [IMG] code is On HTML code is Off

View Your Warnings | New Posts | Latest News | Latest Threads | Shoutbox

Forum Jump