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

Christos Papadimitriou and L (complexity)

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

Difference between Christos Papadimitriou and L (complexity)

Christos Papadimitriou vs. L (complexity)

Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949) is a Greek theoretical computer scientist, and professor of Computer Science at Columbia University. In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space.

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) · See more »

The list above answers the following questions

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:

Hey! We are on Facebook now! »