JSC 2007 - PDF Preprint Papers

JSC 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JSC-2007 Paper

click to vote

JSC
2007

152views more JSC 2007»

Complete involutive rewriting systems

13 years 11 months ago

Download www.maths.bangor.ac.uk

Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...

Gareth A. Evans, Christopher D. Wensley

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	152	Complete involutive rewriting systems	claim
2	130	The Moufang loops of order 64 and 81	claim
3	119	Equisingular calculations for plane curve singularities	claim
4	106	Computing multihomogeneous resultants using straight-line programs	claim
5	104	Generating all polynomial invariants in simple loops	claim
6	104	Summation algorithms for Stirling number identities	claim
7	97	On approximate triangular decompositions in dimension zero	claim
8	84	Simplicial cycles and the computation of simplicial trees	claim
9	80	Improved dense multivariate polynomial factorization algorithms	claim
10	79	Computation of bases of free modules over the Weyl algebras	claim
11	77	Mathscape and molecular integrals	claim
12	72	Linear syntax for communicating elementary mathematics	claim
13	71	Rational invariants of a group action. Construction and rewriting	claim
14	68	Multiple object semilinear motion planning	claim
15	63	On the geometry of parametrized bicubic surfaces	claim
16	61	Set-theoretic solutions of the Yang-Baxter equation, graphs and computations	claim
17	60	An elementary proof of Sylvester's double sums for subresultants	claim
18	58	Foreword from the Editors	claim
19	58	Are Buchberger's criteria necessary for the chain condition?	claim
20	57	Around the numeric-symbolic computation of differential Galois groups	claim
21	56	Restriction of A-discriminants and dual defect toric varieties	claim
22	45	Output-sensitive modular algorithms for polynomial matrix normal forms	claim
23	39	Efficiency improvement in an nD systems approach to polynomial optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers