Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

In 1988, for the first time, the two international conferences AAECC-6 and ISSAC'88 (International Symposium on Symbolic and Algebraic Computation, see Lecture Notes in Computer Science 358) have taken place as a Joint Conference in Rome, July 4-8, 1988. The topics of the two conferences are in fact widely related to each other and the Joint Conference presented a good occasion for the two research communities to meet and share scientific experiences and results. The proceedings of the AAECC-6 are included in this volume. The main topics are: Applied Algebra, Theory and Application of Error-Correcting Codes, Cryptography, Complexity, Algebra Based Methods and Applications in Symbolic Computing and Computer Algebra, and Algebraic Methods and Applications for Advanced Information Processing. Twelve invited papers on subjects of common interest for the two conferences are divided between this volume and the succeeding Lecture Notes volume devoted to ISSACC'88. The proceedings of the 5th conference are published as Vol. 356 of the Lecture Notes in Computer Science.

Computer science --- Information systems --- 681.3*E3 --- 681.3*E4 --- 681.3*F2 --- 681.3*G2 --- 681.3*I1 --- Data encryption: data encryption standard; DES; public key cryptosystems --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Discrete mathematics (Mathematics of computing) --- Algebraic manipulation (Computing methodologies) --- 681.3*I1 Algebraic manipulation (Computing methodologies) --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 681.3*E3 Data encryption: data encryption standard; DES; public key cryptosystems --- Programming languages (Electronic computers) --- Congresses --- Error-correcting codes (Information theory) --- Algebra --- Computer algorithms --- Congresses. --- Data processing --- Algebra. --- Mathematics. --- Coding theory. --- Applications of Mathematics. --- Coding and Information Theory. --- Symbolic and Algebraic Manipulation. --- Data processing. --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Math --- Science --- Mathematics --- Mathematical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The second volume of this comprehensive treatise focusses on Buchberger theory and its application to the algorithmic view of commutative algebra. In distinction to other works, the presentation here is based on the intrinsic linear algebra structure of Groebner bases, and thus elementary considerations lead easily to the state-of-the-art in issues of implementation. The same language describes the applications of Groebner technology to the central problems of commutative algebra. The book can be also used as a reference on elementary ideal theory and a source for the state-of-the-art in its algorithmization. Aiming to provide a complete survey on Groebner bases and their applications, the author also includes advanced aspects of Buchberger theory, such as the complexity of the algorithm, Galligo's theorem, the optimality of degrevlex, the Gianni-Kalkbrener theorem, the FGLM algorithm, and so on. Thus it will be essential for all workers in commutative algebra, computational algebra and algebraic geometry.

Equations --- Polynomials. --- Iterative methods (Mathematics) --- Iteration (Mathematics) --- Numerical analysis --- Algebra --- Numerical solutions. --- Graphic methods --- Gröbner bases. --- Gröbner basis theory --- Commutative algebra

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

In this fourth and final volume the author extends Buchberger's Algorithm in three different directions. First, he extends the theory to group rings and other Ore-like extensions, and provides an operative scheme that allows one to set a Buchberger theory over any effective associative ring. Second, he covers similar extensions as tools for discussing parametric polynomial systems, the notion of SAGBI-bases, Gröbner bases over invariant rings and Hironaka's theory. Finally, Mora shows how Hilbert's followers - notably Janet, Gunther and Macaulay - anticipated Buchberger's ideas and discusses the most promising recent alternatives by Gerdt (involutive bases) and Faugère (F4 and F5). This comprehensive treatment in four volumes is a significant contribution to algorithmic commutative algebra that will be essential reading for algebraists and algebraic geometers.

Equations --- Polynomials. --- Iterative methods (Mathematics) --- Numerical solutions. --- Iteration (Mathematics) --- Numerical analysis --- Algebra --- Graphic methods

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Algebra

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Geometry, Algebraic --- Congresses