Sciweavers

70 search results - page 3 / 14
» A computational introduction to number theory and algebra
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 5 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
AB
2007
Springer
13 years 9 months ago
Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
Alexandre Sedoglavic
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
13 years 11 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
CIE
2005
Springer
13 years 11 months ago
A Thread Algebra with Multi-level Strategic Interleaving
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategi...
Jan A. Bergstra, C. A. Middelburg
CIE
2007
Springer
13 years 11 months ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov