Sciweavers

1368 search results - page 41 / 274
» Generalized Rook Polynomials
Sort
View
AMC
2010
86views more  AMC 2010»
14 years 12 months ago
On properties of cell matrices
In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a s...
Gasper Jaklic, Jolanda Modic
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 12 months ago
Partial Denominator Bounds for Partial Linear Difference Equations
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynom...
Manuel Kauers, Carsten Schneider
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 12 months ago
New Set of Codes for the Maximum-Likelihood Decoding Problem
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
Morgan Barbier
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 12 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 1 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...