Boolean Gröbner bases:
Abstract: "We studied several important properties of Boolean polynomial rings in [SaSa 90]. Especially we saw ideal plays a central role for solving a Boolean constraint. This paper gives an algorithm which produces a rewriting system for a given finitely generated ideal in the ring of Boolean...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
613 |
| Subjects: | |
| Summary: | Abstract: "We studied several important properties of Boolean polynomial rings in [SaSa 90]. Especially we saw ideal plays a central role for solving a Boolean constraint. This paper gives an algorithm which produces a rewriting system for a given finitely generated ideal in the ring of Boolean polynomials. The rewriting system reduces all Boolean polynomials that are equivalent under the ideal to the same normal form." |
| Physical Description: | 14 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953792 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24995710 | ||
| 035 | |a (DE-599)BVBBV010953792 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sakai, Ko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Boolean Gröbner bases |c by K. Sakai, Y. Satoh, & S. Menju |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 14 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 613 | |
| 520 | 3 | |a Abstract: "We studied several important properties of Boolean polynomial rings in [SaSa 90]. Especially we saw ideal plays a central role for solving a Boolean constraint. This paper gives an algorithm which produces a rewriting system for a given finitely generated ideal in the ring of Boolean polynomials. The rewriting system reduces all Boolean polynomials that are equivalent under the ideal to the same normal form." | |
| 650 | 4 | |a Boolean rings | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Sato, Yosuke |e Verfasser |4 aut | |
| 700 | 1 | |a Menju, Satoshi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 613 |w (DE-604)BV010923438 |9 613 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326243 | ||
Record in the Search Index
| _version_ | 1804125440663617536 |
|---|---|
| any_adam_object | |
| author | Sakai, Ko Sato, Yosuke Menju, Satoshi |
| author_facet | Sakai, Ko Sato, Yosuke Menju, Satoshi |
| author_role | aut aut aut |
| author_sort | Sakai, Ko |
| author_variant | k s ks y s ys s m sm |
| building | Verbundindex |
| bvnumber | BV010953792 |
| ctrlnum | (OCoLC)24995710 (DE-599)BVBBV010953792 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01469nam a2200325 cb4500</leader><controlfield tag="001">BV010953792</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24995710</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953792</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">Sakai, Ko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Boolean Gröbner bases</subfield><subfield code="c">by K. Sakai, Y. Satoh, & S. Menju</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">613</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We studied several important properties of Boolean polynomial rings in [SaSa 90]. Especially we saw ideal plays a central role for solving a Boolean constraint. This paper gives an algorithm which produces a rewriting system for a given finitely generated ideal in the ring of Boolean polynomials. The rewriting system reduces all Boolean polynomials that are equivalent under the ideal to the same normal form."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Boolean rings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sato, Yosuke</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">613</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">613</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326243</subfield></datafield></record></collection> |
| id | DE-604.BV010953792 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326243 |
| oclc_num | 24995710 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 |
| spelling | Sakai, Ko Verfasser aut Boolean Gröbner bases by K. Sakai, Y. Satoh, & S. Menju Tokyo, Japan 1991 14 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 613 Abstract: "We studied several important properties of Boolean polynomial rings in [SaSa 90]. Especially we saw ideal plays a central role for solving a Boolean constraint. This paper gives an algorithm which produces a rewriting system for a given finitely generated ideal in the ring of Boolean polynomials. The rewriting system reduces all Boolean polynomials that are equivalent under the ideal to the same normal form." Boolean rings Rewriting systems (Computer science) Sato, Yosuke Verfasser aut Menju, Satoshi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 613 (DE-604)BV010923438 613 |
| spellingShingle | Sakai, Ko Sato, Yosuke Menju, Satoshi Boolean Gröbner bases Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Boolean rings Rewriting systems (Computer science) |
| title | Boolean Gröbner bases |
| title_auth | Boolean Gröbner bases |
| title_exact_search | Boolean Gröbner bases |
| title_full | Boolean Gröbner bases by K. Sakai, Y. Satoh, & S. Menju |
| title_fullStr | Boolean Gröbner bases by K. Sakai, Y. Satoh, & S. Menju |
| title_full_unstemmed | Boolean Gröbner bases by K. Sakai, Y. Satoh, & S. Menju |
| title_short | Boolean Gröbner bases |
| title_sort | boolean grobner bases |
| topic | Boolean rings Rewriting systems (Computer science) |
| topic_facet | Boolean rings Rewriting systems (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT sakaiko booleangrobnerbases AT satoyosuke booleangrobnerbases AT menjusatoshi booleangrobnerbases |