10 citations · 15 across the 8 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.DS2011★ 1 cited
Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm
Siavosh Benabbas, Hyun Chul Lee, Joel Oren +1
We introduce a new regression problem which we call the Sum-Based Hierarchical Smoothing problem. Given a directed acyclic graph and a non-negative value, called target value, for…
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…
cs.FL2011
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages
Janusz Brzozowski, Baiyu Li, Yuli Ye
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maxima…