Arithmetic complexity of computations: "Based on lectures given by the author at the University of Pittsburgh."
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
[1980]
|
| Schriftenreihe: | CBMS-NSF regional conference series in applied mathematics
33 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
| Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 93) Three examples -- General background -- Product of polynomials -- FIR filters -- Product of polynomials modulo a polynomial -- Cyclic convolution and discrete Fourier transform Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation |
| Beschreibung: | 1 Online-Ressource (iii, 93 Seiten) |
| ISBN: | 0898711630 9780898711639 |
| DOI: | 10.1137/1.9781611970364 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039747264 | ||
| 003 | DE-604 | ||
| 005 | 20210125 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 111207s1980 sz |||| o||u| ||||||eng d | ||
| 010 | |a 79093154 | ||
| 020 | |a 0898711630 |c pbk. |9 0898711630 | ||
| 020 | |a 9780898711639 |c pbk. |9 9780898711639 | ||
| 024 | 7 | |a 10.1137/1.9781611970364 |2 doi | |
| 035 | |a (OCoLC)775728824 | ||
| 035 | |a (DE-599)BVBBV039747264 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a sz |c XA-CH | ||
| 049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
| 084 | |a SI 196 |0 (DE-625)143099: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Winograd, Shmuel |d 1936-2019 |e Verfasser |0 (DE-588)1203114796 |4 aut | |
| 245 | 1 | 0 | |a Arithmetic complexity of computations |b "Based on lectures given by the author at the University of Pittsburgh." |c Shmuel Winograd |
| 264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c [1980] | |
| 264 | 4 | |c © 1980 | |
| 300 | |a 1 Online-Ressource (iii, 93 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a CBMS-NSF regional conference series in applied mathematics |v 33 | |
| 500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
| 500 | |a Includes bibliographical references (p. 93) | ||
| 500 | |a Three examples -- General background -- Product of polynomials -- FIR filters -- Product of polynomials modulo a polynomial -- Cyclic convolution and discrete Fourier transform | ||
| 500 | |a Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Bilinear forms / Data processing | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0898711630 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 9780898711639 |
| 830 | 0 | |a CBMS-NSF regional conference series in applied mathematics |v 33 |w (DE-604)BV046682627 |9 33 | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611970364 |x Verlag |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024594795 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970364 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970364 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970364 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970364 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148637499916288 |
|---|---|
| any_adam_object | |
| author | Winograd, Shmuel 1936-2019 |
| author_GND | (DE-588)1203114796 |
| author_facet | Winograd, Shmuel 1936-2019 |
| author_role | aut |
| author_sort | Winograd, Shmuel 1936-2019 |
| author_variant | s w sw |
| building | Verbundindex |
| bvnumber | BV039747264 |
| classification_rvk | SI 196 ST 134 |
| collection | ZDB-72-SIA |
| ctrlnum | (OCoLC)775728824 (DE-599)BVBBV039747264 |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1137/1.9781611970364 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03884nmm a2200697 cb4500</leader><controlfield tag="001">BV039747264</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210125 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s1980 sz |||| o||u| ||||||eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">79093154</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898711630</subfield><subfield code="c">pbk.</subfield><subfield code="9">0898711630</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898711639</subfield><subfield code="c">pbk.</subfield><subfield code="9">9780898711639</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611970364</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)775728824</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747264</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 196</subfield><subfield code="0">(DE-625)143099:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Winograd, Shmuel</subfield><subfield code="d">1936-2019</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1203114796</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Arithmetic complexity of computations</subfield><subfield code="b">"Based on lectures given by the author at the University of Pittsburgh."</subfield><subfield code="c">Shmuel Winograd</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">[1980]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (iii, 93 Seiten)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">33</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 93)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Three examples -- General background -- Product of polynomials -- FIR filters -- Product of polynomials modulo a polynomial -- Cyclic convolution and discrete Fourier transform</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bilinear forms / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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="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">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="1"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0898711630</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">9780898711639</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">33</subfield><subfield code="w">(DE-604)BV046682627</subfield><subfield code="9">33</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611970364</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594795</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970364</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970364</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970364</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970364</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039747264 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:10:18Z |
| institution | BVB |
| isbn | 0898711630 9780898711639 |
| language | English |
| lccn | 79093154 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594795 |
| oclc_num | 775728824 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| physical | 1 Online-Ressource (iii, 93 Seiten) |
| psigel | ZDB-72-SIA |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
| record_format | marc |
| series | CBMS-NSF regional conference series in applied mathematics |
| series2 | CBMS-NSF regional conference series in applied mathematics |
| spelling | Winograd, Shmuel 1936-2019 Verfasser (DE-588)1203114796 aut Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." Shmuel Winograd Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) [1980] © 1980 1 Online-Ressource (iii, 93 Seiten) txt rdacontent c rdamedia cr rdacarrier CBMS-NSF regional conference series in applied mathematics 33 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 93) Three examples -- General background -- Product of polynomials -- FIR filters -- Product of polynomials modulo a polynomial -- Cyclic convolution and discrete Fourier transform Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation Datenverarbeitung Bilinear forms / Data processing Computational complexity Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Numerisches Verfahren (DE-588)4128130-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Komplexität (DE-588)4135369-9 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Numerisches Verfahren (DE-588)4128130-5 s 2\p DE-604 Erscheint auch als Druck-Ausgabe, Paperback 0898711630 Erscheint auch als Druck-Ausgabe, Paperback 9780898711639 CBMS-NSF regional conference series in applied mathematics 33 (DE-604)BV046682627 33 https://doi.org/10.1137/1.9781611970364 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Winograd, Shmuel 1936-2019 Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." CBMS-NSF regional conference series in applied mathematics Datenverarbeitung Bilinear forms / Data processing Computational complexity Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Numerisches Verfahren (DE-588)4128130-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4001183-5 (DE-588)4128130-5 (DE-588)4120591-1 |
| title | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." |
| title_auth | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." |
| title_exact_search | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." |
| title_full | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." Shmuel Winograd |
| title_fullStr | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." Shmuel Winograd |
| title_full_unstemmed | Arithmetic complexity of computations "Based on lectures given by the author at the University of Pittsburgh." Shmuel Winograd |
| title_short | Arithmetic complexity of computations |
| title_sort | arithmetic complexity of computations based on lectures given by the author at the university of pittsburgh |
| title_sub | "Based on lectures given by the author at the University of Pittsburgh." |
| topic | Datenverarbeitung Bilinear forms / Data processing Computational complexity Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Numerisches Verfahren (DE-588)4128130-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Datenverarbeitung Bilinear forms / Data processing Computational complexity Komplexität Algorithmus Numerisches Verfahren Komplexitätstheorie |
| url | https://doi.org/10.1137/1.9781611970364 |
| volume_link | (DE-604)BV046682627 |
| work_keys_str_mv | AT winogradshmuel arithmeticcomplexityofcomputationsbasedonlecturesgivenbytheauthorattheuniversityofpittsburgh |