364 search results - page 26 / 73 » Dimension Characterizations of Complexity Classes |
TARK
2007
Springer
14 years 1 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
AAAI
2008
13 years 9 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
NIPS
2008
13 years 8 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...