|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-211-77417-5 |
003 |
DE-He213 |
005 |
20220119021751.0 |
007 |
cr nn 008mamaa |
008 |
100301s2008 au | s |||| 0|eng d |
020 |
|
|
|a 9783211774175
|9 978-3-211-77417-5
|
024 |
7 |
|
|a 10.1007/978-3-211-77417-5
|2 doi
|
050 |
|
4 |
|a QA267-268.5
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a MAT018000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 005.131
|2 23
|
100 |
1 |
|
|a Sturmfels, Bernd.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Algorithms in Invariant Theory
|h [electronic resource] /
|c by Bernd Sturmfels.
|
250 |
|
|
|a 2nd ed. 2008.
|
264 |
|
1 |
|a Vienna :
|b Springer Vienna :
|b Imprint: Springer,
|c 2008.
|
300 |
|
|
|a VII, 197 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,
|x 2197-8409
|
505 |
0 |
|
|a Invariant theory of finite groups -- Bracket algebra and projective geometry -- Invariants of the general linear group.
|
520 |
|
|
|a J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Algebraic geometry.
|
650 |
1 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Discrete Mathematics.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|
650 |
2 |
4 |
|a Algebraic Geometry.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783211101896
|
776 |
0 |
8 |
|i Printed edition:
|z 9783211774168
|
830 |
|
0 |
|a Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,
|x 2197-8409
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-211-77417-5
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|