منابع مشابه
. A C ] 1 6 Ju n 20 03 RIGID RESOLUTIONS AND BIG BETTI NUMBERS
Let K be a field of characteristic 0 and S = K[x1, . . . , xn] the polynomial ring over K with graded maximal ideal m = (x1, . . . , xn). Denote by βi(M) = Tor S i (K,M) the ith Betti number of a finitely generated graded module M and by Gin(I) the generic initial ideal of a graded ideal I with respect to the reverse lexicographical order. In this paper we answer (positively) a question raised ...
متن کاملAbstract OO Big O
OO Big O Joan Krone Denison University Department of Math and CS Granville, Ohio 43023 740-587-6484 [email protected] W. F. Ogden The Ohio State University Neal Avenue Columbus, Ohio 43210 614-292-6007 [email protected] SUMMARY When traditional Big O analysis is rigorously applied to object oriented software, several deficiencies quickly manifest themselves. Because the traditional defin...
متن کاملep - t h / 03 06 10 9 v 1 1 2 Ju n 20 03 Cosmological Perturbations in a Big Crunch / Big Bang Space - time
A prescription is developed for matching general relativistic perturbations across singularities of the type encountered in the ekpyrotic and cyclic scenarios, i.e., a collision between orbifold planes. We show that there exists a gauge in which the evolution of perturbations is locally identical to that in a model space-time (compactified Milne mod Z2) where the matching of modes across the si...
متن کاملDiscussing the "big n problem"
When a large amount of spatial data is available computational and modeling challenges arise and they are often labeled as “big n problem”. In this work we present a brief review of the literature. Then we focus on two approaches, respectively based on stochastic partial differential equations and integrated nested Laplace approximation, and on the tapering of the spatial covariance matrix. The...
متن کاملar X iv : c s / 03 11 03 9 v 1 [ cs . C R ] 2 6 N ov 2 00 3 Quantum m - out - of - n Oblivious Transfer ∗
In the m-out-of-n oblivious transfer (OT) model, one party Alice sends n bits to another party Bob, Bob can get only m bits from the n bits. However, Alice cannot know which m bits Bob received. Y.Mu[12] and Naor[8] presented classical m-out-of-n oblivious transfer based on discrete logarithm. As the work of Shor [9], the discrete logarithm can be solved in polynomial time by quantum computers,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Clinical Medicine & Research
سال: 2008
ISSN: 1539-4182,1554-6179
DOI: 10.3121/cmr.6.3-4.125