P-NP-Problem: What are the most promising methods?

Posted by phimuemue on Stack Overflow See other posts from Stack Overflow or by phimuemue
Published on 2010-05-24T23:22:59Z Indexed on 2010/05/26 7:41 UTC
Read the original article Hit count: 263

Filed under:

computer-science

|

theoretical

|

p-np

|

np

Hello everybody,

I know that P=NP has not been solved up to now, but can anybody tell me something about the following: What are currently the most promising mathematical / computer scientific methods that could be helpful to tackle this problem? Or are there even none such methods known to be potentially helpful up to now? Is there any (free) compendium on this topic where I can find all / most of the research done in this area?

© Stack Overflow or respective owner

Related posts about computer-science

How do I completely self study computer science?

as seen on Programmers - Search for 'Programmers'
Being a completely self taught programmer I would like it if I could better myself by self-learning computer science course taught to a typical CS grad. Finding different resources on internet has been easy, there is of course MIT open course ware, and there are Coursera courses from Stanford and… >>> More
what, why, when, should I learn computer science?

as seen on Programmers - Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question: What is computer science? Should a web programmer learn computer science? If the answer of question 2 is yes, then what programming language(s)… >>> More
what, why, when, should I learn computer science?

as seen on Programmers - Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question: What is computer science is? Should a web programmer learn computer science? If the answer of question 2 is yes, then what programming… >>> More
What topic in computer science is this?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I am trying to figure out what 'topic' this is called, so I can learn more about it. Basically, I'm talking about designing my applications's architecture. I'm not talking about algorithms. More like -- this class should have these methods and these instance variables, and communicate with… >>> More
Computer Science Resume [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
I am looking for a good computer science resume. I just graduated, and I would like to see some samples from real programmers. The ones online don't seem that great. Sorry if this is posted in the wrong section. >>> More

Related posts about theoretical

Theoretical introduction of Custom Binding in WCF

as seen on C# Corner - Search for 'C# Corner'
Custom Binding provides the full control over the messaging stack for the user. >>> More
NAT / PAT Theoretical Question

as seen on Server Fault - Search for 'Server Fault'
Given the following simplistic network Would it be possible to construct NAT / PAT pools such that the PC's attached to the network could be identified by their port number. I understand that if I assign a public IP to each user I can identify them. What I am trying to do is to conserve Public… >>> More
client-server syncing methodology [theoretical]

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm in the progress of building an web-app that syncs with an iOS client. I'm currently tackling trying to figure out how to go about about syncing. I've come up with following two directions: I've got a fairly simple server web-app with a list of items. They are ordered by date modified and as such… >>> More
Genetics algorithms theoretical question

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi All! I'm currently reading "Artificial Intelligence: A Modern Approach" (Russell+Norvig) and "Machine Learning" (Mitchell) - and trying to learn basics of AINN. In order to understand few basic things I have two 'greenhorn' questions: Q1: In a genetic algorithm given the two parents A and B… >>> More
(type theoretical) How is ([] ==) [] typed in haskell?

as seen on Stack Overflow - Search for 'Stack Overflow'
It sounds silly, but I can't get it. Why can the expression [] == [] be typed at all? More specifically, which type (in class Eq) is inferred to the type of list elements? In a ghci session, I see the following: Prelude> :t (==[]) (==[]) :: (Eq [a]) => [a] -> Bool But the constraint Eq… >>> More