<--- Back to Details
First PageDocument Content
Numerical software / Mathematics / Computational group theory / Donald Knuth / KnuthBendix completion algorithm / GCD test
Date: 2011-04-03 10:18:30
Numerical software
Mathematics
Computational group theory
Donald Knuth
KnuthBendix completion algorithm
GCD test

Microsoft PowerPoint - ch07_9 [Compatibility Mode]

Add to Reading List

Source URL: www.math.nus.edu.sg

Download Document from Source Website

File Size: 1,26 MB

Share Document on Facebook

Similar Documents

Computational group theory / Donald Knuth / KnuthBendix completion algorithm / Flow chart language

Meta-Predicates for Rodin Sebastian Krings Institut fur ¨ Informatik ¨ Dusseldorf Heinrich-Heine-Universitat

DocID: 1r6UG - View Document

Numerical software / Mathematics / Computational group theory / Donald Knuth / KnuthBendix completion algorithm / GCD test

Microsoft PowerPoint - ch07_9 [Compatibility Mode]

DocID: 1qTUq - View Document

Computational group theory / Donald Knuth / KnuthBendix completion algorithm / Bidirectional associative memory

A non-desarguesian projective plane K.Tent and B.Zilber October 2, 2012 1

DocID: 1ql41 - View Document

Mathematics / Combinatorial optimization / Greedoid / Order theory / Matroid / Submodular set function / KnuthBendix completion algorithm

PDF Document

DocID: 1qbUT - View Document

Mathematics / Mathematical analysis / Operator theory / Compact operator / KnuthBendix completion algorithm

NARROW OPERATORS AND THE DAUGAVET PROPERTY FOR ULTRAPRODUCTS DMITRIY BILIK, VLADIMIR KADETS, ROMAN SHVIDKOY, AND DIRK WERNER Abstract. We show that if T is a narrow operator (for the definition see below) on X = X1 ⊕1

DocID: 1pUCA - View Document