Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Question on computaional complexity

Status
Not open for further replies.

pmonon

Full Member level 3
Full Member level 3
Joined
Jan 28, 2006
Messages
152
Helped
7
Reputation
14
Reaction score
1
Trophy points
1,298
Activity points
2,232
What is NP hard and NP complete? Which one is more difficult or complex? I need an "as simple as possible but no simpler" type explanation please...
 

NP is short for non-polynomial!
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top