1368 search results - page 88 / 274 » Generalized Rook Polynomials |
118
click to vote
JCT
2007
15 years 4 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
135
click to vote
ORL
1998
15 years 4 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
121
click to vote
ADCM
2008
15 years 3 months ago
2008
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
126
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
110
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...