Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

David S. Johnson and Polynomial hierarchy

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between David S. Johnson and Polynomial hierarchy

David S. Johnson vs. Polynomial hierarchy

David Stifler Johnson (December 9, 1945 – March 8, 2016) was an American computer scientist specializing in algorithms and optimization. In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines.

Similarities between David S. Johnson and Polynomial hierarchy

David S. Johnson and Polynomial hierarchy have 2 things in common (in Unionpedia): Computers and Intractability, Michael Garey.

Computers and Intractability

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson.

Computers and Intractability and David S. Johnson · Computers and Intractability and Polynomial hierarchy · See more »

Michael Garey

Michael Randolph Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness.

David S. Johnson and Michael Garey · Michael Garey and Polynomial hierarchy · See more »

The list above answers the following questions

David S. Johnson and Polynomial hierarchy Comparison

David S. Johnson has 21 relations, while Polynomial hierarchy has 41. As they have in common 2, the Jaccard index is 3.23% = 2 / (21 + 41).

References

This article shows the relationship between David S. Johnson and Polynomial hierarchy. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »