Highly Influential

In 1990 Subramanian de ned the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (Ccv). He and Mayr showed that NL⊆CC⊆P, and proved that in addition to Ccv several other problems are complete for CC, including the stable marriage problem, and nding the lexicographically rst maximal matching in a bipartite… (More)

- Stable marriage problem
- Digital comparator
- Clomiphene
- Comparator
- Circuit Value Problem
- Algorithm
- P-complete
- Comparator Device Component
- Matching (graph theory)
- Parallel algorithm
- Proof complexity
- AC0
- Complexity class
- Polynomial
- NC (complexity)
- algorithm
- Log-space reduction
- Model of computation
- Many-one reduction
- L (complexity)
- Quantum gate
- Maxima and minima
- Maximal set
- Lexicographical order
- Time complexity