The complexity of the word problems for commutative semigroups and polynomial ideals:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1981
|
Schlagworte: | |
Beschreibung: | 32 S. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021896080 | ||
003 | DE-604 | ||
005 | 20040301000000.0 | ||
007 | t | ||
008 | 910226s1981 |||| 00||| eng d | ||
035 | |a (OCoLC)8160755 | ||
035 | |a (DE-599)BVBBV021896080 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a MIT LCS TM 199 | ||
100 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
245 | 1 | 0 | |a The complexity of the word problems for commutative semigroups and polynomial ideals |c by Ernst W. Mayr and Albert R. Meyer |
264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1981 | |
300 | |a 32 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 4 | |a Algorithms | |
650 | 4 | |a Polynomials | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Halbgruppe |0 (DE-588)4022990-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Wortproblem |0 (DE-588)4337256-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Petri-Netz |0 (DE-588)4045388-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Halbgruppe |0 (DE-588)4022990-7 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Petri-Netz |0 (DE-588)4045388-1 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Wortproblem |0 (DE-588)4337256-9 |D s |
689 | 4 | |5 DE-604 | |
700 | 1 | |a Meyer, Albert R. |e Verfasser |4 aut | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015111265 |
Datensatz im Suchindex
_version_ | 1804135840778027008 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Mayr, Ernst W. 1950- Meyer, Albert R. |
author_GND | (DE-588)109817923 |
author_facet | Mayr, Ernst W. 1950- Meyer, Albert R. |
author_role | aut aut |
author_sort | Mayr, Ernst W. 1950- |
author_variant | e w m ew ewm a r m ar arm |
building | Verbundindex |
bvnumber | BV021896080 |
ctrlnum | (OCoLC)8160755 (DE-599)BVBBV021896080 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01595nam a2200469zc 4500</leader><controlfield tag="001">BV021896080</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910226s1981 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)8160755</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896080</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 199</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mayr, Ernst W.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109817923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of the word problems for commutative semigroups and polynomial ideals</subfield><subfield code="c">by Ernst W. Mayr and Albert R. Meyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 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="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Halbgruppe</subfield><subfield code="0">(DE-588)4022990-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wortproblem</subfield><subfield code="0">(DE-588)4337256-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Halbgruppe</subfield><subfield code="0">(DE-588)4022990-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Wortproblem</subfield><subfield code="0">(DE-588)4337256-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyer, Albert R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111265</subfield></datafield></record></collection> |
id | DE-604.BV021896080 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:04:23Z |
indexdate | 2024-07-09T20:46:54Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111265 |
oclc_num | 8160755 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 32 S. |
publishDate | 1981 |
publishDateSearch | 1981 |
publishDateSort | 1981 |
publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
record_format | marc |
spelling | Mayr, Ernst W. 1950- Verfasser (DE-588)109817923 aut The complexity of the word problems for commutative semigroups and polynomial ideals by Ernst W. Mayr and Albert R. Meyer Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1981 32 S. txt rdacontent n rdamedia nc rdacarrier Algorithms Polynomials Algorithmus (DE-588)4001183-5 gnd rswk-swf Halbgruppe (DE-588)4022990-7 gnd rswk-swf Wortproblem (DE-588)4337256-9 gnd rswk-swf Petri-Netz (DE-588)4045388-1 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Halbgruppe (DE-588)4022990-7 s Petri-Netz (DE-588)4045388-1 s Komplexität (DE-588)4135369-9 s Wortproblem (DE-588)4337256-9 s Meyer, Albert R. Verfasser aut |
spellingShingle | Mayr, Ernst W. 1950- Meyer, Albert R. The complexity of the word problems for commutative semigroups and polynomial ideals Algorithms Polynomials Algorithmus (DE-588)4001183-5 gnd Halbgruppe (DE-588)4022990-7 gnd Wortproblem (DE-588)4337256-9 gnd Petri-Netz (DE-588)4045388-1 gnd Komplexität (DE-588)4135369-9 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4022990-7 (DE-588)4337256-9 (DE-588)4045388-1 (DE-588)4135369-9 |
title | The complexity of the word problems for commutative semigroups and polynomial ideals |
title_auth | The complexity of the word problems for commutative semigroups and polynomial ideals |
title_exact_search | The complexity of the word problems for commutative semigroups and polynomial ideals |
title_exact_search_txtP | The complexity of the word problems for commutative semigroups and polynomial ideals |
title_full | The complexity of the word problems for commutative semigroups and polynomial ideals by Ernst W. Mayr and Albert R. Meyer |
title_fullStr | The complexity of the word problems for commutative semigroups and polynomial ideals by Ernst W. Mayr and Albert R. Meyer |
title_full_unstemmed | The complexity of the word problems for commutative semigroups and polynomial ideals by Ernst W. Mayr and Albert R. Meyer |
title_short | The complexity of the word problems for commutative semigroups and polynomial ideals |
title_sort | the complexity of the word problems for commutative semigroups and polynomial ideals |
topic | Algorithms Polynomials Algorithmus (DE-588)4001183-5 gnd Halbgruppe (DE-588)4022990-7 gnd Wortproblem (DE-588)4337256-9 gnd Petri-Netz (DE-588)4045388-1 gnd Komplexität (DE-588)4135369-9 gnd |
topic_facet | Algorithms Polynomials Algorithmus Halbgruppe Wortproblem Petri-Netz Komplexität |
work_keys_str_mv | AT mayrernstw thecomplexityofthewordproblemsforcommutativesemigroupsandpolynomialideals AT meyeralbertr thecomplexityofthewordproblemsforcommutativesemigroupsandpolynomialideals |