blob: f128cb38d2b192e371f20d601073fb0bef1acac7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://srcux.com/dtd/metadata.dtd">
<pkgmetadata>
<maintainer type="person">
<email>mjo@gentoo.org</email>
</maintainer>
<maintainer type="person">
<email>frp.bissey@gmail.com</email>
<name>François Bissey</name>
</maintainer>
<maintainer type="project" proxied="proxy">
<email>proxy-maint@gentoo.org</email>
<name>Proxy Maintainers</name>
</maintainer>
<maintainer type="project">
<email>sci-mathematics@gentoo.org</email>
<name>Gentoo Mathematics Project</name>
</maintainer>
<longdescription lang="en">
The GBNP package provides algorithms for computing Grobner bases of
noncommutative polynomials with coefficients from a field
implemented in GAP and with respect to the "total degree first then
lexicographical" ordering. Further provided are some variations,
such as a weighted and truncated version and a tracing facility. The
word "algorithm" is to be interpreted loosely here: in general one
cannot expect such an algorithm to terminate, as it would imply
solvability of the word problem for finitely presented (semi)groups.
</longdescription>
<origin>srcux</origin>
</pkgmetadata>
|
