Similarities between Christos Papadimitriou and L (complexity)
Christos Papadimitriou and L (complexity) have 1 thing in common (in Unionpedia): Computational complexity theory.
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
Christos Papadimitriou and Computational complexity theory · Computational complexity theory and L (complexity) ·
The list above answers the following questions
- What Christos Papadimitriou and L (complexity) have in common
- What are the similarities between Christos Papadimitriou and L (complexity)
Christos Papadimitriou and L (complexity) Comparison
Christos Papadimitriou has 52 relations, while L (complexity) has 39. As they have in common 1, the Jaccard index is 1.10% = 1 / (52 + 39).
References
This article shows the relationship between Christos Papadimitriou and L (complexity). To access each article from which the information was extracted, please visit: