A combinatorial proof of the all minors matrix tree theorem:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Albany, New York
1981
|
Schriftenreihe: | State University of New York <Albany, NY> / Department of Computer Science: Technical report
1981,3 |
Beschreibung: | 24 Bl. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009978130 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 950110s1981 |||| 00||| engod | ||
035 | |a (OCoLC)46027539 | ||
035 | |a (DE-599)BVBBV009978130 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
050 | 0 | |a QE527 | |
100 | 1 | |a Chaiken, Seth |e Verfasser |4 aut | |
245 | 1 | 0 | |a A combinatorial proof of the all minors matrix tree theorem |
264 | 1 | |a Albany, New York |c 1981 | |
300 | |a 24 Bl. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a State University of New York <Albany, NY> / Department of Computer Science: Technical report |v 1981,3 | |
810 | 2 | |a Department of Computer Science: Technical report |t State University of New York <Albany, NY> |v 1981,3 |w (DE-604)BV008905729 |9 1981,3 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006612909 |
Datensatz im Suchindex
_version_ | 1804124351604195328 |
---|---|
any_adam_object | |
author | Chaiken, Seth |
author_facet | Chaiken, Seth |
author_role | aut |
author_sort | Chaiken, Seth |
author_variant | s c sc |
building | Verbundindex |
bvnumber | BV009978130 |
callnumber-first | Q - Science |
callnumber-label | QE527 |
callnumber-raw | QE527 |
callnumber-search | QE527 |
callnumber-sort | QE 3527 |
callnumber-subject | QE - Geology |
ctrlnum | (OCoLC)46027539 (DE-599)BVBBV009978130 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00908nam a2200265 cb4500</leader><controlfield tag="001">BV009978130</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950110s1981 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46027539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009978130</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="050" ind1=" " ind2="0"><subfield code="a">QE527</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaiken, Seth</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A combinatorial proof of the all minors matrix tree theorem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Albany, New York</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 Bl.</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">State University of New York <Albany, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">1981,3</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">State University of New York <Albany, NY></subfield><subfield code="v">1981,3</subfield><subfield code="w">(DE-604)BV008905729</subfield><subfield code="9">1981,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006612909</subfield></datafield></record></collection> |
id | DE-604.BV009978130 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:44:17Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006612909 |
oclc_num | 46027539 |
open_access_boolean | |
physical | 24 Bl. |
publishDate | 1981 |
publishDateSearch | 1981 |
publishDateSort | 1981 |
record_format | marc |
series2 | State University of New York <Albany, NY> / Department of Computer Science: Technical report |
spelling | Chaiken, Seth Verfasser aut A combinatorial proof of the all minors matrix tree theorem Albany, New York 1981 24 Bl. txt rdacontent n rdamedia nc rdacarrier State University of New York <Albany, NY> / Department of Computer Science: Technical report 1981,3 Department of Computer Science: Technical report State University of New York <Albany, NY> 1981,3 (DE-604)BV008905729 1981,3 |
spellingShingle | Chaiken, Seth A combinatorial proof of the all minors matrix tree theorem |
title | A combinatorial proof of the all minors matrix tree theorem |
title_auth | A combinatorial proof of the all minors matrix tree theorem |
title_exact_search | A combinatorial proof of the all minors matrix tree theorem |
title_full | A combinatorial proof of the all minors matrix tree theorem |
title_fullStr | A combinatorial proof of the all minors matrix tree theorem |
title_full_unstemmed | A combinatorial proof of the all minors matrix tree theorem |
title_short | A combinatorial proof of the all minors matrix tree theorem |
title_sort | a combinatorial proof of the all minors matrix tree theorem |
volume_link | (DE-604)BV008905729 |
work_keys_str_mv | AT chaikenseth acombinatorialproofoftheallminorsmatrixtreetheorem |