Complexity of fixed point computations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1989
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1253 |
| Schlagworte: | |
| Beschreibung: | Stanford, Calif., Univ., Diss. |
| Beschreibung: | X, 93 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002103724 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 891025s1989 m||| 00||| eng d | ||
| 035 | |a (OCoLC)20244034 | ||
| 035 | |a (DE-599)BVBBV002103724 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 084 | |a DAT 517d |2 stub | ||
| 088 | |a STAN CS 89 1253 | ||
| 100 | 1 | |a Vavasis, Stephen A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complexity of fixed point computations |c Stephen Andrew Vavasis |
| 264 | 1 | |a Stanford, Calif. |c 1989 | |
| 300 | |a X, 93 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1253 | |
| 500 | |a Stanford, Calif., Univ., Diss. | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Fixed point theory | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1253 |w (DE-604)BV008928280 |9 1253 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001379193 | ||
Datensatz im Suchindex
| _version_ | 1804116557120405504 |
|---|---|
| any_adam_object | |
| author | Vavasis, Stephen A. |
| author_facet | Vavasis, Stephen A. |
| author_role | aut |
| author_sort | Vavasis, Stephen A. |
| author_variant | s a v sa sav |
| building | Verbundindex |
| bvnumber | BV002103724 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| classification_tum | DAT 517d |
| ctrlnum | (OCoLC)20244034 (DE-599)BVBBV002103724 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01136nam a2200349 cb4500</leader><controlfield tag="001">BV002103724</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">891025s1989 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20244034</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002103724</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><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">STAN CS 89 1253</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vavasis, Stephen A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of fixed point computations</subfield><subfield code="c">Stephen Andrew Vavasis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 93 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1253</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Stanford, Calif., Univ., Diss.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fixed point theory</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="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1253</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1253</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001379193</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV002103724 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:40:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001379193 |
| oclc_num | 20244034 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-29T |
| owner_facet | DE-91G DE-BY-TUM DE-29T |
| physical | X, 93 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Vavasis, Stephen A. Verfasser aut Complexity of fixed point computations Stephen Andrew Vavasis Stanford, Calif. 1989 X, 93 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1253 Stanford, Calif., Univ., Diss. Computational complexity Fixed point theory (DE-588)4113937-9 Hochschulschrift gnd-content Computer Science Department: Report STAN-CS Stanford University 1253 (DE-604)BV008928280 1253 |
| spellingShingle | Vavasis, Stephen A. Complexity of fixed point computations Computational complexity Fixed point theory |
| subject_GND | (DE-588)4113937-9 |
| title | Complexity of fixed point computations |
| title_auth | Complexity of fixed point computations |
| title_exact_search | Complexity of fixed point computations |
| title_full | Complexity of fixed point computations Stephen Andrew Vavasis |
| title_fullStr | Complexity of fixed point computations Stephen Andrew Vavasis |
| title_full_unstemmed | Complexity of fixed point computations Stephen Andrew Vavasis |
| title_short | Complexity of fixed point computations |
| title_sort | complexity of fixed point computations |
| topic | Computational complexity Fixed point theory |
| topic_facet | Computational complexity Fixed point theory Hochschulschrift |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT vavasisstephena complexityoffixedpointcomputations |