17 citations · 41 across the 9 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012
The Complexity of the Comparator Circuit Value Problem
Stephen A. Cook, Yuval Filmus, Dai Tri Man Le
In 1990 Subramanian defined 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 \subseteq C…
cs.CC2011★ 2 cited
Complexity Classes and Theories for the Comparator Circuit Value Problem
Stephen A. Cook, Dai Tri Man Le, Yuli Ye
Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem. He proved that several other problems are complete f…