Complexity of algorithms and computations: [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005]
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier
2007
|
| Schriftenreihe: | Theoretical computer science
383,2/3 |
| Schlagworte: | |
| Beschreibung: | Einzelaufnahme eines Zeitschr.-Heftes |
| Beschreibung: | S. 112 - 289 graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV022819468 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 070924s2007 d||| |||| 10||| eng d | ||
| 035 | |a (OCoLC)635278113 | ||
| 035 | |a (DE-599)BSZ27179903X | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-706 | ||
| 245 | 1 | 0 | |a Complexity of algorithms and computations |b [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |c guest eds.: M. Burgin ... |
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier |c 2007 | |
| 300 | |a S. 112 - 289 |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Theoretical computer science |v 383,2/3 | |
| 500 | |a Einzelaufnahme eines Zeitschr.-Heftes | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Burgin, Mark S. |4 edt | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016024848 | ||
Datensatz im Suchindex
| _version_ | 1804137095495680000 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Burgin, Mark S. |
| author2_role | edt |
| author2_variant | m s b ms msb |
| author_facet | Burgin, Mark S. |
| building | Verbundindex |
| bvnumber | BV022819468 |
| ctrlnum | (OCoLC)635278113 (DE-599)BSZ27179903X |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01004nam a2200277 cb4500</leader><controlfield tag="001">BV022819468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070924s2007 d||| |||| 10||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)635278113</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ27179903X</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-384</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of algorithms and computations</subfield><subfield code="b">[papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005]</subfield><subfield code="c">guest eds.: M. Burgin ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">S. 112 - 289</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Theoretical computer science</subfield><subfield code="v">383,2/3</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Einzelaufnahme eines Zeitschr.-Heftes</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burgin, Mark S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016024848</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV022819468 |
| illustrated | Illustrated |
| index_date | 2024-07-02T18:39:28Z |
| indexdate | 2024-07-09T21:06:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016024848 |
| oclc_num | 635278113 |
| open_access_boolean | |
| owner | DE-384 DE-706 |
| owner_facet | DE-384 DE-706 |
| physical | S. 112 - 289 graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Elsevier |
| record_format | marc |
| series2 | Theoretical computer science |
| spelling | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] guest eds.: M. Burgin ... Amsterdam [u.a.] Elsevier 2007 S. 112 - 289 graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretical computer science 383,2/3 Einzelaufnahme eines Zeitschr.-Heftes (DE-588)1071861417 Konferenzschrift gnd-content Burgin, Mark S. edt |
| spellingShingle | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| subject_GND | (DE-588)1071861417 |
| title | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| title_auth | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| title_exact_search | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| title_exact_search_txtP | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| title_full | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] guest eds.: M. Burgin ... |
| title_fullStr | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] guest eds.: M. Burgin ... |
| title_full_unstemmed | Complexity of algorithms and computations [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] guest eds.: M. Burgin ... |
| title_short | Complexity of algorithms and computations |
| title_sort | complexity of algorithms and computations papers from the two day session on complexity of computation and algorithms of the american mathematical society meeting in santa barbara april 2005 |
| title_sub | [papers from ... the two-day Session on Complexity of Computation and Algorithms of the American Mathematical Society Meeting in Santa Barbara, April 2005] |
| topic_facet | Konferenzschrift |
| work_keys_str_mv | AT burginmarks complexityofalgorithmsandcomputationspapersfromthetwodaysessiononcomplexityofcomputationandalgorithmsoftheamericanmathematicalsocietymeetinginsantabarbaraapril2005 |