Home Page
Overview
Consortium
Bibliography
Members' Area
Contact
Links
FP6
Theorema Contributions
Papers cited in part 8 of Deliverable 4.2
B. Buchberger
:
Algorithm invention and verification by lazy thinking.
In: D. Petcu, V. Negru, D. Zaharie, T. Jebelean (eds), Proceedings of SYNASC 2003 (Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, October 1-4, 2003), Mirton Publishing, ISBN 973-661-104-3, pp. 2-26.
[
postscript
] [
pdf
]
B. Buchberger, A. Craciun
:
Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema.
In: F. Kamaredine (ed.), International Workshop on Mathematical Knowledge Management, Edinburgh, Nov. 2003.
[
pdf
]
B. Buchberger
:
Algorithm Retrieval: Concept Clarification and Case Study in Theorema.
Technical Report SFB 2003-44, Special Research Area "Scientific Computing", Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, October 2003.
[
postscript
, Mathematica
notebook
]
B. Buchberger
:
Groebner Rings in Theorema: A Case Study in Functors and Categories.
Technical Report SFB 2003-26, Special Research Area "Scientific Computing", Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, November 2003.
[This paper is available only as Mathematica
notebook
. For viewing it please use MathReader which is available free of charge at
www.wolfram.com/mathreader
.]
W. Windsteiger
:
Exploring an Algorithm for Polynomial Interpolation in the Theorema System.
Technical report, Laboratoire d'Informatique de Paris 6, 2003.
Proceedings of Calculemus'03, September 10-12, Rome, Italy.
[
postscript
] [
pdf
]
Home Page
Overview
Consortium
Bibliography
Members' Area
Contact
Links
FP6
Maintained by
Mike Dewar
© The MKMNET Consortium 2002-2003