Sciweavers

886 search results - page 7 / 178
» Generalized Bezout Identity
Sort
View
JCT
2007
90views more  JCT 2007»
13 years 7 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
PERCOM
2009
ACM
14 years 8 months ago
RationalExposure: a Game Theoretic Approach to Optimize Identity Exposure in Pervasive Computing Environments
In pervasive computing environments, personal information is expressed in digital forms to a great extent. Daily activities and personal preferences may be easily associated with p...
Feng Zhu, Wei Zhu
JCT
2006
81views more  JCT 2006»
13 years 7 months ago
New identities involving Bernoulli and Euler polynomials
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...
Hao Pan, Zhi-Wei Sun
ESA
1999
Springer
148views Algorithms» more  ESA 1999»
13 years 12 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
DAGSTUHL
2007
13 years 9 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena