Algorithmic Algebraic Combinatorics and Gröbner Bases
This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. Topics covered include coherent configurations, asso...
| Corporate Author: | SpringerLink (Online service) |
|---|---|
| Other Authors: | Klin, Mikhail (Editor), Jones, Gareth A. (Editor), Jurišić, Aleksandar (Editor), Muzychuk, Mikhail (Editor), Ponomarenko, Ilia (Editor) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2009.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
by: Beck, Matthias, et al.
Published: (2007) -
Gröbner Bases, Coding, and Cryptography
Published: (2009) -
Sparsity Graphs, Structures, and Algorithms /
by: Nešetřil, Jaroslav, et al.
Published: (2012) -
Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
by: Beck, Matthias, et al.
Published: (2015) -
Optimal Interconnection Trees in the Plane Theory, Algorithms and Applications /
by: Brazil, Marcus, et al.
Published: (2015)