Efficient checking of polynomials and proofs and the hardness of approximation problems:
This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1995
|
| Schriftenreihe: | Lecture notes in computer science
1001 |
| Schlagworte: | |
| Zusammenfassung: | This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory. |
| Beschreibung: | XIV, 87 S. |
| ISBN: | 3540606157 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010521367 | ||
| 003 | DE-604 | ||
| 005 | 20160707 | ||
| 007 | t| | ||
| 008 | 951204s1995 gw m||| 00||| eng d | ||
| 016 | 7 | |a 94619095X |2 DE-101 | |
| 020 | |a 3540606157 |9 3-540-60615-7 | ||
| 035 | |a (OCoLC)33971740 | ||
| 035 | |a (DE-599)BVBBV010521367 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-29T |a DE-20 |a DE-19 |a DE-12 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA267.S83 1995 | |
| 082 | 0 | |a 005.1/4/015113 |2 20 | |
| 082 | 0 | |a 005.1/4/015113 20 | |
| 084 | |a ST 304 |0 (DE-625)143653: |2 rvk | ||
| 084 | |a 27 |2 sdnb | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Sudan, Madhu |d 1966- |e Verfasser |0 (DE-588)1103857258 |4 aut | |
| 245 | 1 | 0 | |a Efficient checking of polynomials and proofs and the hardness of approximation problems |c Madhu Sudan |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1995 | |
| 300 | |a XIV, 87 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1001 | |
| 502 | |a Zugl.: Berkeley, Univ., Diss., 1992 | ||
| 520 | 3 | |a This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory. | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Problèmes NP-complets | |
| 650 | 4 | |a Théorèmes - Démonstration automatique | |
| 650 | 4 | |a NP-complete problems | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 0 | 7 | |a Komplexitätsklasse |0 (DE-588)4164913-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomapproximation |0 (DE-588)4197097-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Polynomapproximation |0 (DE-588)4197097-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 1 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 2 | 1 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 2 | 2 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 2 | 3 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 2 | 4 | |a Komplexitätsklasse |0 (DE-588)4164913-8 |D s |
| 689 | 2 | 5 | |a Beweis |0 (DE-588)4132532-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 1001 |w (DE-604)BV000000607 |9 1001 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007014100 | |
Datensatz im Suchindex
| _version_ | 1820874849114914816 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Sudan, Madhu 1966- |
| author_GND | (DE-588)1103857258 |
| author_facet | Sudan, Madhu 1966- |
| author_role | aut |
| author_sort | Sudan, Madhu 1966- |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV010521367 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.S83 1995 |
| callnumber-search | QA267.S83 1995 |
| callnumber-sort | QA 3267 S83 41995 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 304 |
| ctrlnum | (OCoLC)33971740 (DE-599)BVBBV010521367 |
| dewey-full | 005.1/4/015113 005.1/4/01511320 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1/4/015113 005.1/4/015113 20 |
| dewey-search | 005.1/4/015113 005.1/4/015113 20 |
| dewey-sort | 15.1 14 515113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010521367</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160707</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951204s1995 gw m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94619095X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540606157</subfield><subfield code="9">3-540-60615-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33971740</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010521367</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.S83 1995</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/4/015113</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/4/015113 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 304</subfield><subfield code="0">(DE-625)143653:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sudan, Madhu</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1103857258</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient checking of polynomials and proofs and the hardness of approximation problems</subfield><subfield code="c">Madhu Sudan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 87 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">Lecture notes in computer science</subfield><subfield code="v">1001</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Berkeley, Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problèmes NP-complets</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorèmes - Démonstration automatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätsklasse</subfield><subfield code="0">(DE-588)4164913-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-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ä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">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomapproximation</subfield><subfield code="0">(DE-588)4197097-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polynomapproximation</subfield><subfield code="0">(DE-588)4197097-4</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="3"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="4"><subfield code="a">Komplexitätsklasse</subfield><subfield code="0">(DE-588)4164913-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="5"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1001</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1001</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007014100</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010521367 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:16Z |
| institution | BVB |
| isbn | 3540606157 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007014100 |
| oclc_num | 33971740 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-19 DE-BY-UBM DE-12 DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-19 DE-BY-UBM DE-12 DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | XIV, 87 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Sudan, Madhu 1966- Verfasser (DE-588)1103857258 aut Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan Berlin [u.a.] Springer 1995 XIV, 87 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1001 Zugl.: Berkeley, Univ., Diss., 1992 This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory. Complexité de calcul (Informatique) Problèmes NP-complets Théorèmes - Démonstration automatique NP-complete problems Computational complexity Automatic theorem proving Komplexitätsklasse (DE-588)4164913-8 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Polynomapproximation (DE-588)4197097-4 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Polynomapproximation (DE-588)4197097-4 s DE-604 Approximation (DE-588)4002498-2 s Komplexität (DE-588)4135369-9 s Optimierungsproblem (DE-588)4390818-4 s NP-vollständiges Problem (DE-588)4138229-8 s Polynomialzeitalgorithmus (DE-588)4199652-5 s Komplexitätsklasse (DE-588)4164913-8 s Beweis (DE-588)4132532-1 s Lecture notes in computer science 1001 (DE-604)BV000000607 1001 |
| spellingShingle | Sudan, Madhu 1966- Efficient checking of polynomials and proofs and the hardness of approximation problems Lecture notes in computer science Complexité de calcul (Informatique) Problèmes NP-complets Théorèmes - Démonstration automatique NP-complete problems Computational complexity Automatic theorem proving Komplexitätsklasse (DE-588)4164913-8 gnd Approximation (DE-588)4002498-2 gnd Optimierungsproblem (DE-588)4390818-4 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Komplexität (DE-588)4135369-9 gnd Beweis (DE-588)4132532-1 gnd Polynomapproximation (DE-588)4197097-4 gnd |
| subject_GND | (DE-588)4164913-8 (DE-588)4002498-2 (DE-588)4390818-4 (DE-588)4138229-8 (DE-588)4199652-5 (DE-588)4135369-9 (DE-588)4132532-1 (DE-588)4197097-4 (DE-588)4113937-9 |
| title | Efficient checking of polynomials and proofs and the hardness of approximation problems |
| title_auth | Efficient checking of polynomials and proofs and the hardness of approximation problems |
| title_exact_search | Efficient checking of polynomials and proofs and the hardness of approximation problems |
| title_full | Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan |
| title_fullStr | Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan |
| title_full_unstemmed | Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan |
| title_short | Efficient checking of polynomials and proofs and the hardness of approximation problems |
| title_sort | efficient checking of polynomials and proofs and the hardness of approximation problems |
| topic | Complexité de calcul (Informatique) Problèmes NP-complets Théorèmes - Démonstration automatique NP-complete problems Computational complexity Automatic theorem proving Komplexitätsklasse (DE-588)4164913-8 gnd Approximation (DE-588)4002498-2 gnd Optimierungsproblem (DE-588)4390818-4 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Komplexität (DE-588)4135369-9 gnd Beweis (DE-588)4132532-1 gnd Polynomapproximation (DE-588)4197097-4 gnd |
| topic_facet | Complexité de calcul (Informatique) Problèmes NP-complets Théorèmes - Démonstration automatique NP-complete problems Computational complexity Automatic theorem proving Komplexitätsklasse Approximation Optimierungsproblem NP-vollständiges Problem Polynomialzeitalgorithmus Komplexität Beweis Polynomapproximation Hochschulschrift |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT sudanmadhu efficientcheckingofpolynomialsandproofsandthehardnessofapproximationproblems |