Scholars Central

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The P vs. NP problem is to find the answer to a search problem without searching. To find the needle in a hay stack without searching; which can be achieved with the use of a powerful magnet. Therefore the P vs. NP solution is to define the details of the computer equivalent “magnet,” for its use in solving NP complete, NP and P problems. This article provides a general formula which can be adapted to reduce the amount of time spent in solving each type of problem (NP complete problems, NP problems and P problems).

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Innovative Research in Computer and Communication Engineering.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Innovative Research in Computer and Communication Engineering
  • SubjectComputer Science & IT
  • SubjectEngineering
  • SubjectSocial Sciences & Humanities
  • BylineArticles whose byline prints “Dominic Alexander Cooper”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels