A The Complexity of the Comparator Circuit Value Problem


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)


11 Figures and Tables

Slides referencing similar topics