1368 search results - page 21 / 274 » Generalized Rook Polynomials |
ACL2
2006
ACM
14 years 2 months ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
EJC
2011
13 years 1 hour ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
ACL
2000
13 years 9 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
NA
2007
13 years 8 months ago
2007
GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
A new class of associations (polynomial itemsets and polynomial association rules) is presented which allows for discovering nonlinear relationships between numeric attributes wit...