Showing papers in "Bulletin of The European Association for Theoretical Computer Science in 1984"

On rough sets

Abstract: W: Bulletin of the European Association for Theoretical Computer Science (EATCS), 24:94-109, 1984

Polynomial-time algorithms for the factorization of polynomials

Abstract: In 1982 a polynomial-time algorithm for factoring polynomials in one variable with rational coefficients was published (see A.K. Lenstra, H.W. Lenstra, Jr. and L. Lovasz, Math. Ann., vol.261, p.515-34, 1982). This L3-algorithm came as a rather big surprise: hardly anybody expected that the problem allowed solution in polynomial time. The purpose of this note is to present an informal description of the L3-algorithm

Big omega versus the wild functions.

Abstract: The question of the desirable properties and proper definitions of the Order-of-Magnitude symbols, in particular O and O, is addressed once more. The definitions proposed are chosen for complementary mathematical properties, rather than for similarity of form.