1368 search results - page 76 / 274 » Generalized Rook Polynomials |
120
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
128
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
212
click to vote
CDB
1997
Springer
15 years 8 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
120
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
133
click to vote
EUROCRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...