Some Maxmin Location and pattern separation Problems: theory and algorithms:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
1975
|
Schlagworte: |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV024269464 | ||
003 | DE-604 | ||
005 | 20090910 | ||
007 | t | ||
008 | 090924s1975 |||| 00||| und d | ||
035 | |a (OCoLC)916278992 | ||
035 | |a (DE-599)BVBBV024269464 | ||
040 | |a DE-604 |b ger |e pi | ||
041 | |a und | ||
049 | |a DE-83 | ||
100 | 1 | |a Dasarathy, Balakrishnan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Some Maxmin Location and pattern separation Problems: theory and algorithms |
264 | 1 | |c 1975 | |
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 0 | 7 | |a Standortproblem |0 (DE-588)4301515-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Polyeder |0 (DE-588)4132101-7 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Standortproblem |0 (DE-588)4301515-3 |D s |
689 | 0 | 1 | |a Polyeder |0 (DE-588)4132101-7 |D s |
689 | 0 | |8 2\p |5 DE-604 | |
940 | 1 | |q TUB-n | |
999 | |a oai:aleph.bib-bvb.de:BVB01-018170771 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804140146487984129 |
---|---|
any_adam_object | |
author | Dasarathy, Balakrishnan |
author_facet | Dasarathy, Balakrishnan |
author_role | aut |
author_sort | Dasarathy, Balakrishnan |
author_variant | b d bd |
building | Verbundindex |
bvnumber | BV024269464 |
ctrlnum | (OCoLC)916278992 (DE-599)BVBBV024269464 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01142nam a2200337 c 4500</leader><controlfield tag="001">BV024269464</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1975 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916278992</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024269464</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">pi</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dasarathy, Balakrishnan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Some Maxmin Location and pattern separation Problems: theory and algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1975</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="650" ind1="0" ind2="7"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-n</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018170771</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV024269464 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T21:55:20Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018170771 |
oclc_num | 916278992 |
open_access_boolean | |
owner | DE-83 |
owner_facet | DE-83 |
psigel | TUB-n |
publishDate | 1975 |
publishDateSearch | 1975 |
publishDateSort | 1975 |
record_format | marc |
spelling | Dasarathy, Balakrishnan Verfasser aut Some Maxmin Location and pattern separation Problems: theory and algorithms 1975 txt rdacontent n rdamedia nc rdacarrier Standortproblem (DE-588)4301515-3 gnd rswk-swf Polyeder (DE-588)4132101-7 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Standortproblem (DE-588)4301515-3 s Polyeder (DE-588)4132101-7 s 2\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Dasarathy, Balakrishnan Some Maxmin Location and pattern separation Problems: theory and algorithms Standortproblem (DE-588)4301515-3 gnd Polyeder (DE-588)4132101-7 gnd |
subject_GND | (DE-588)4301515-3 (DE-588)4132101-7 (DE-588)4113937-9 |
title | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_auth | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_exact_search | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_full | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_fullStr | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_full_unstemmed | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_short | Some Maxmin Location and pattern separation Problems: theory and algorithms |
title_sort | some maxmin location and pattern separation problems theory and algorithms |
topic | Standortproblem (DE-588)4301515-3 gnd Polyeder (DE-588)4132101-7 gnd |
topic_facet | Standortproblem Polyeder Hochschulschrift |
work_keys_str_mv | AT dasarathybalakrishnan somemaxminlocationandpatternseparationproblemstheoryandalgorithms |