Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations:
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Amsterdam
1973
|
Schriftenreihe: | Mathematisch Centrum <Amsterdam> / Afdeling Mathematische Besliskunde: BW
28 |
Schlagwörter: | |
Umfang: | 38 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009664656 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t| | ||
008 | 940621s1973 xx |||| 00||| engod | ||
035 | |a (OCoLC)1498425 | ||
035 | |a (DE-599)BVBBV009664656 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
050 | 0 | |a QA248.5 | |
100 | 1 | |a Lenstra, Jan K. |d 1947- |e Verfasser |0 (DE-588)124437613 |4 aut | |
245 | 1 | 0 | |a Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations |c J. K. Lenstra |
264 | 1 | |a Amsterdam |c 1973 | |
300 | |a 38 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Mathematisch Centrum <Amsterdam> / Afdeling Mathematische Besliskunde: BW |v 28 | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Recursive functions | |
810 | 2 | |a Afdeling Mathematische Besliskunde: BW |t Mathematisch Centrum <Amsterdam> |v 28 |w (DE-604)BV002808162 |9 28 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006390869 |
Datensatz im Suchindex
_version_ | 1818951795589775360 |
---|---|
any_adam_object | |
author | Lenstra, Jan K. 1947- |
author_GND | (DE-588)124437613 |
author_facet | Lenstra, Jan K. 1947- |
author_role | aut |
author_sort | Lenstra, Jan K. 1947- |
author_variant | j k l jk jkl |
building | Verbundindex |
bvnumber | BV009664656 |
callnumber-first | Q - Science |
callnumber-label | QA248 |
callnumber-raw | QA248.5 |
callnumber-search | QA248.5 |
callnumber-sort | QA 3248.5 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)1498425 (DE-599)BVBBV009664656 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00986nam a2200289 cb4500</leader><controlfield tag="001">BV009664656</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940621s1973 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1498425</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009664656</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">QA248.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lenstra, Jan K.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124437613</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations</subfield><subfield code="c">J. K. Lenstra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 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">Mathematisch Centrum <Amsterdam> / Afdeling Mathematische Besliskunde: BW</subfield><subfield code="v">28</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Afdeling Mathematische Besliskunde: BW</subfield><subfield code="t">Mathematisch Centrum <Amsterdam></subfield><subfield code="v">28</subfield><subfield code="w">(DE-604)BV002808162</subfield><subfield code="9">28</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006390869</subfield></datafield></record></collection> |
id | DE-604.BV009664656 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T09:40:10Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006390869 |
oclc_num | 1498425 |
open_access_boolean | |
physical | 38 S. |
publishDate | 1973 |
publishDateSearch | 1973 |
publishDateSort | 1973 |
record_format | marc |
series2 | Mathematisch Centrum <Amsterdam> / Afdeling Mathematische Besliskunde: BW |
spelling | Lenstra, Jan K. 1947- Verfasser (DE-588)124437613 aut Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations J. K. Lenstra Amsterdam 1973 38 S. txt rdacontent n rdamedia nc rdacarrier Mathematisch Centrum <Amsterdam> / Afdeling Mathematische Besliskunde: BW 28 Algorithms Recursive functions Afdeling Mathematische Besliskunde: BW Mathematisch Centrum <Amsterdam> 28 (DE-604)BV002808162 28 |
spellingShingle | Lenstra, Jan K. 1947- Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations Algorithms Recursive functions |
title | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations |
title_auth | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations |
title_exact_search | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations |
title_full | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations J. K. Lenstra |
title_fullStr | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations J. K. Lenstra |
title_full_unstemmed | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations J. K. Lenstra |
title_short | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations |
title_sort | recursive algorithms for enumerating subsets lattice points combinations and permutations |
topic | Algorithms Recursive functions |
topic_facet | Algorithms Recursive functions |
volume_link | (DE-604)BV002808162 |
work_keys_str_mv | AT lenstrajank recursivealgorithmsforenumeratingsubsetslatticepointscombinationsandpermutations |