A note on Nielsen reduction and coset enumeration

Authors:
Birgit Reinert;Klaus Madlener;Teo Mora
Affiliations:
Universität Kaiserslautern, 67663 Kaiserslautern, Germany;Universität Kaiserslautern, 67663 Kaiserslautern, Germany;DISI, Via Dodecaneso, 35, 16146 Genova, Italy
Venue:
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Year:
1998

Citing 7
Cited 2

The Nielsen reduction and P-complete problems in free groups

Theoretical Computer Science
Systems of reductions

Systems of reductions
String-rewriting systems

String-rewriting systems
Computing Gröbner bases in monoid and group rings

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

Theoretical Computer Science - Special issue on rewriting techniques and applications
The Construction of Multivariate Polynomials with Preassigned Zeros

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra

Cited References

Computer algebra handbook
Gröbner Representations of Binary Matroids

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract