The sandwich theorem:
Abstract: "This report contains expository notes about a function [symbol](G) that is popularly known as the Lovász number of a graph G. There are many ways to define [symbol](G), and the surprising variety of different characterizations indicates in itself that [symbol](G) should be interestin...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1499 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This report contains expository notes about a function [symbol](G) that is popularly known as the Lovász number of a graph G. There are many ways to define [symbol](G), and the surprising variety of different characterizations indicates in itself that [symbol](G) should be interesting. But the most interesting property of [symbol](G) is probably the fact that it can be computed efficiently, although it lies 'sandwiched' between other classic graph numbers whose computation is NP-hard. I have tried to make these notes self-contained so that they might serve as an elementary introduction to the growing literature on Lovász's fascinating function." |
| Beschreibung: | 48 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009568013 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940427s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31371862 | ||
| 035 | |a (DE-599)BVBBV009568013 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Knuth, Donald Ervin |d 1938- |e Verfasser |0 (DE-588)121578437 |4 aut | |
| 245 | 1 | 0 | |a The sandwich theorem |c Donald E. Knuth |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 48 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 1499 | |
| 520 | 3 | |a Abstract: "This report contains expository notes about a function [symbol](G) that is popularly known as the Lovász number of a graph G. There are many ways to define [symbol](G), and the surprising variety of different characterizations indicates in itself that [symbol](G) should be interesting. But the most interesting property of [symbol](G) is probably the fact that it can be computed efficiently, although it lies 'sandwiched' between other classic graph numbers whose computation is NP-hard. I have tried to make these notes self-contained so that they might serve as an elementary introduction to the growing literature on Lovász's fascinating function." | |
| 650 | 4 | |a NP-complete problems | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1499 |w (DE-604)BV008928280 |9 1499 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006321072 | ||
Datensatz im Suchindex
| _version_ | 1804123908094296064 |
|---|---|
| any_adam_object | |
| author | Knuth, Donald Ervin 1938- |
| author_GND | (DE-588)121578437 |
| author_facet | Knuth, Donald Ervin 1938- |
| author_role | aut |
| author_sort | Knuth, Donald Ervin 1938- |
| author_variant | d e k de dek |
| building | Verbundindex |
| bvnumber | BV009568013 |
| ctrlnum | (OCoLC)31371862 (DE-599)BVBBV009568013 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01578nam a2200289 cb4500</leader><controlfield tag="001">BV009568013</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940427s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31371862</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009568013</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Knuth, Donald Ervin</subfield><subfield code="d">1938-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121578437</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The sandwich theorem</subfield><subfield code="c">Donald E. Knuth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">48 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">1499</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This report contains expository notes about a function [symbol](G) that is popularly known as the Lovász number of a graph G. There are many ways to define [symbol](G), and the surprising variety of different characterizations indicates in itself that [symbol](G) should be interesting. But the most interesting property of [symbol](G) is probably the fact that it can be computed efficiently, although it lies 'sandwiched' between other classic graph numbers whose computation is NP-hard. I have tried to make these notes self-contained so that they might serve as an elementary introduction to the growing literature on Lovász's fascinating function."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</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">1499</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1499</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006321072</subfield></datafield></record></collection> |
| id | DE-604.BV009568013 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:37:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006321072 |
| oclc_num | 31371862 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 48 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Knuth, Donald Ervin 1938- Verfasser (DE-588)121578437 aut The sandwich theorem Donald E. Knuth Stanford, Calif. 1993 48 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1499 Abstract: "This report contains expository notes about a function [symbol](G) that is popularly known as the Lovász number of a graph G. There are many ways to define [symbol](G), and the surprising variety of different characterizations indicates in itself that [symbol](G) should be interesting. But the most interesting property of [symbol](G) is probably the fact that it can be computed efficiently, although it lies 'sandwiched' between other classic graph numbers whose computation is NP-hard. I have tried to make these notes self-contained so that they might serve as an elementary introduction to the growing literature on Lovász's fascinating function." NP-complete problems Computer Science Department: Report STAN CS Stanford University 1499 (DE-604)BV008928280 1499 |
| spellingShingle | Knuth, Donald Ervin 1938- The sandwich theorem NP-complete problems |
| title | The sandwich theorem |
| title_auth | The sandwich theorem |
| title_exact_search | The sandwich theorem |
| title_full | The sandwich theorem Donald E. Knuth |
| title_fullStr | The sandwich theorem Donald E. Knuth |
| title_full_unstemmed | The sandwich theorem Donald E. Knuth |
| title_short | The sandwich theorem |
| title_sort | the sandwich theorem |
| topic | NP-complete problems |
| topic_facet | NP-complete problems |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT knuthdonaldervin thesandwichtheorem |