ISSAC '96: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation : July 24-26, 1996, Zurich, Switzerland |
Contents
Wednesday July 24 8301000 | 1 |
Thursday July 25 8301000 | 25 |
Computing Complexification of a Semialgebraic Set | 26 |
Copyright | |
20 other sections not shown
Common terms and phrases
algorithm applied approximation arithmetic asymptotic b₁ binomial ideals bound calculation coefficients column complexity components computer algebra computer algebra system Computer Science conjugacy classes d'Alembertian decomposition defined degree denote derivatives differential ideal dimension domain encoding entries evaluation example exponential space factor finite field Gröbner basis Groebner h₁ Hermite normal form idempotents implementation input integer irreducible Janet base Lemma linear Math Mathematics matrix method mial minimal polynomial monic monomial multiplication node nomial normal form notation obtained operations parallel parameters poly polyno polynomial polynomial ring problem processors Proof quantum machine rational function recursively reduced Gröbner basis representation resp result ring rithm root semi-algebraic set Sf.g singular Smith normal form solution solving step structure Symbolic Computation symmetry group tensor Theorem tion transformation u₁ variables vector w₁ zero