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 ·
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 ·
The list above answers the following questions
- What David S. Johnson and Polynomial hierarchy have in common
- What are the similarities between David S. Johnson and Polynomial hierarchy
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: