The P Vs NP Problem: A Method for Solving NP-Complete Problems by Use of Graph Embodiment on a Quantum Computation Paradigm Using a Relational Database Query

Provided by: The World
Topic: Data Management
Format: PDF
The relationship between the complexity class P and NP is one of the most fascinating and unresolved question in theoretical computer science. The classical computational paradigm, hedged on Turing paper may be by itself the limiting factor. To investigate this relationship, a method for solving a query problem on a relational database on the classical and the quantum computational paradigm has been developed. The method solves queries or database problems through the use of graphs.

Find By Topic