Removing redundant critical polynomials in construction of Boolean Gröbner bases:
Gespeichert in:
Beteiligte Personen: | , , |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Tokyo, Japan
1992
|
Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
786 |
Schlagwörter: | |
Abstract: | Abstract: "Detecting redundant S-polynomials raise efficiency of Buchberger's algorithm to construct Gröbner bases as was first pointed out in [Buchberger 79]. One of the most practical criteria for it is given in terms of a homogeneous basis of a module of syzygies. This criterion is also applicable in suitable forms even when coefficient domains are not fields. We show we can apply this criterion in construction of Boolean Gröbner bases introduced in [Sakai 92]. We examine its efficiency with some experimental results of our implementation." |
Umfang: | 8 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010956339 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t| | ||
008 | 960918s1992 xx |||| 00||| engod | ||
035 | |a (OCoLC)34387127 | ||
035 | |a (DE-599)BVBBV010956339 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Sato, Yosuke |e Verfasser |4 aut | |
245 | 1 | 0 | |a Removing redundant critical polynomials in construction of Boolean Gröbner bases |c by Y. Sato, S. Menju & K. Sakai |
264 | 1 | |a Tokyo, Japan |c 1992 | |
300 | |a 8 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 786 | |
520 | 3 | |a Abstract: "Detecting redundant S-polynomials raise efficiency of Buchberger's algorithm to construct Gröbner bases as was first pointed out in [Buchberger 79]. One of the most practical criteria for it is given in terms of a homogeneous basis of a module of syzygies. This criterion is also applicable in suitable forms even when coefficient domains are not fields. We show we can apply this criterion in construction of Boolean Gröbner bases introduced in [Sakai 92]. We examine its efficiency with some experimental results of our implementation." | |
650 | 4 | |a Gröbner bases | |
650 | 4 | |a Polynomials | |
700 | 1 | |a Menju, Satoshi |e Verfasser |4 aut | |
700 | 1 | |a Sakai, Ko |e Verfasser |4 aut | |
830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 786 |w (DE-604)BV010923438 |9 786 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007328488 |
Datensatz im Suchindex
DE-BY-TUM_call_number | 0111 2001 B 6123-786 |
---|---|
DE-BY-TUM_katkey | 766201 |
DE-BY-TUM_location | 01 |
DE-BY-TUM_media_number | 040010279571 |
_version_ | 1821938143916457984 |
any_adam_object | |
author | Sato, Yosuke Menju, Satoshi Sakai, Ko |
author_facet | Sato, Yosuke Menju, Satoshi Sakai, Ko |
author_role | aut aut aut |
author_sort | Sato, Yosuke |
author_variant | y s ys s m sm k s ks |
building | Verbundindex |
bvnumber | BV010956339 |
ctrlnum | (OCoLC)34387127 (DE-599)BVBBV010956339 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01630nam a2200325 cb4500</leader><controlfield tag="001">BV010956339</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960918s1992 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34387127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956339</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sato, Yosuke</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Removing redundant critical polynomials in construction of Boolean Gröbner bases</subfield><subfield code="c">by Y. Sato, S. Menju & K. Sakai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">786</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Detecting redundant S-polynomials raise efficiency of Buchberger's algorithm to construct Gröbner bases as was first pointed out in [Buchberger 79]. One of the most practical criteria for it is given in terms of a homogeneous basis of a module of syzygies. This criterion is also applicable in suitable forms even when coefficient domains are not fields. We show we can apply this criterion in construction of Boolean Gröbner bases introduced in [Sakai 92]. We examine its efficiency with some experimental results of our implementation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gröbner bases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Menju, Satoshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sakai, Ko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">786</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">786</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328488</subfield></datafield></record></collection> |
id | DE-604.BV010956339 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T10:03:48Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328488 |
oclc_num | 34387127 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 8 S. |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
record_format | marc |
series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
spellingShingle | Sato, Yosuke Menju, Satoshi Sakai, Ko Removing redundant critical polynomials in construction of Boolean Gröbner bases Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Gröbner bases Polynomials |
title | Removing redundant critical polynomials in construction of Boolean Gröbner bases |
title_auth | Removing redundant critical polynomials in construction of Boolean Gröbner bases |
title_exact_search | Removing redundant critical polynomials in construction of Boolean Gröbner bases |
title_full | Removing redundant critical polynomials in construction of Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
title_fullStr | Removing redundant critical polynomials in construction of Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
title_full_unstemmed | Removing redundant critical polynomials in construction of Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
title_short | Removing redundant critical polynomials in construction of Boolean Gröbner bases |
title_sort | removing redundant critical polynomials in construction of boolean grobner bases |
topic | Gröbner bases Polynomials |
topic_facet | Gröbner bases Polynomials |
volume_link | (DE-604)BV010923438 |
work_keys_str_mv | AT satoyosuke removingredundantcriticalpolynomialsinconstructionofbooleangrobnerbases AT menjusatoshi removingredundantcriticalpolynomialsinconstructionofbooleangrobnerbases AT sakaiko removingredundantcriticalpolynomialsinconstructionofbooleangrobnerbases |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
Signatur: |
0111 2001 B 6123-786 Lageplan |
---|---|
Exemplar 1 | Ausleihbar Am Standort |