Explore the latest books of this year!
Bookbot

Franz Winkler

    Symbolic and numerical scientific computation
    Automated deduction in geometry
    Algebraic informatics
    Polynomial Algorithms in Computer Algebra
    • Polynomial Algorithms in Computer Algebra

      • 288 pages
      • 11 hours of reading

      The book is a comprehensive compilation of course notes on computer algebra, developed through years of teaching at various universities and summer schools. It reflects the author's journey in the field, incorporating feedback and contributions from students and colleagues who have influenced his understanding and application of computer algebra concepts. Key figures in the author's academic development are acknowledged, particularly for their roles in shaping the content. The author emphasizes personal responsibility for any remaining errors in the material.

      Polynomial Algorithms in Computer Algebra
    • This book constitutes the refereed proceedings of the 4th International Conference on Algebraic Informatics, CAI 2011, held in Linz, Austria, in June 2011. The 12 revised full papers presented together with 4 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.

      Algebraic informatics
    • Automated deduction in geometry

      • 231 pages
      • 9 hours of reading

      This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Automated Deduction in Geometry, ADG 2002, held at Hagenberg Castle, Austria in September 2002. The 13 revised full papers presented were carefully selected during two rounds of reviewing and improvement. Among the issues addressed are theoretical and methodological topics, such as the resolution of singularities, algebraic geometry and computer algebra; various geometric theorem proving systems are explored; and applications of automated deduction in geometry are demonstrated in fields like computer-aided design and robotics.

      Automated deduction in geometry
    • This book constitutes the thoroughly refereed post-proceedings of the Second International Conference on Symbolic and Numerical Scientific Computation, SNSC 2001, held in Hagenberg, Austria, in September 2001. The 19 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers are organized in topical sections on symbolics and numerics of differential equations, symbolics and numerics in algebra and geometry, and applications in physics and engineering.

      Symbolic and numerical scientific computation