Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronic 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.

Register Log in

Question on computaional complexity

Status
Not open for further replies.

pmonon

Full Member level 3
Joined
Jan 28, 2006
Messages
155
Helped
7
Reputation
14
Reaction score
1
Trophy points
1,298
Activity points
2,243
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...
 

pmonon

Full Member level 3
Joined
Jan 28, 2006
Messages
155
Helped
7
Reputation
14
Reaction score
1
Trophy points
1,298
Activity points
2,243
NP is short for non-polynomial!
 

Status
Not open for further replies.
Toggle Sidebar

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top