Titlebook: Computer Science -- Theory and Applications; First International Dima Grigoriev,John Harrison,Edward A. Hirsch Conference proceedings 2006

荧光

灰姑娘

迁移

Complexity of Polynomial Multiplication over Finite Fieldsovel combination of two known techniques. One technique is the analysis of Hankel matrices representing bilinear forms defined by linear combinations of the coefficients of the polynomial product. The other technique is a counting argument from the coding theory.

植物茂盛

Constructive Equivalence Relations on Computable Probability Measuresogorov-Loveland random reals, and having the same computably random reals. In particular, we show that, when restricted to the class of strongly positive generalized Bernoulli measures, they all coincide with the classical equivalence, which requires that two measures have the same nullsets.

红润

Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varietiesynomial–time algorithms to substantiate this model are described in zero–characteristic. The main result here is a construction of the intersection of algebraic varieties. As applications we get efficient algorithms for constructing the smooth stratification and smooth cover of an algebraic variety introduced by the author earlier.

Inertia

antenna

https://doi.org/10.1057/9780230288164nstraint types are Boolean combinations of the equality relation, and we call the corresponding constraint languages .. We show that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism, and is NP-complete otherwise.

N斯巴达人

finite

floaters

Development of the Stock Markets,izzini’s techniques: Our construction is polynomial in terms of the number of states but still double-exponential in the size of the alphabet. As opposed to Métivier’s work, our algorithm does not restrict to acyclic dependence alphabets.