Parametrized complexity:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New York [u.a.]
Springer
1999
|
Schriftenreihe: | Monographs in computer science
|
Schlagworte: | |
Beschreibung: | XV, 533 S. graph. Darst. |
ISBN: | 038794883X |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV025251676 | ||
003 | DE-604 | ||
005 | 20220913 | ||
007 | t | ||
008 | 100417s1999 d||| |||| 00||| eng d | ||
020 | |a 038794883X |9 0-387-94883-X | ||
035 | |a (OCoLC)845440392 | ||
035 | |a (DE-599)BVBBV025251676 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-11 |a DE-188 | ||
082 | 0 | |a 511.3 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
100 | 1 | |a Downey, R. G. |d 1957- |e Verfasser |0 (DE-588)1052125417 |4 aut | |
245 | 1 | 0 | |a Parametrized complexity |c R. G. Downey ; M. R. Fellows |
264 | 1 | |a New York [u.a.] |b Springer |c 1999 | |
300 | |a XV, 533 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Monographs in computer science | |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
689 | 1 | 1 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |D s |
689 | 1 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | 3 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |D s |
689 | 1 | |5 DE-604 | |
700 | 1 | |a Fellows, M. R. |e Sonstige |4 oth | |
999 | |a oai:aleph.bib-bvb.de:BVB01-019888718 |
Datensatz im Suchindex
_version_ | 1804142309713903616 |
---|---|
any_adam_object | |
author | Downey, R. G. 1957- |
author_GND | (DE-588)1052125417 |
author_facet | Downey, R. G. 1957- |
author_role | aut |
author_sort | Downey, R. G. 1957- |
author_variant | r g d rg rgd |
building | Verbundindex |
bvnumber | BV025251676 |
classification_rvk | ST 134 ST 130 |
ctrlnum | (OCoLC)845440392 (DE-599)BVBBV025251676 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01682nam a2200457 c 4500</leader><controlfield tag="001">BV025251676</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220913 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s1999 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">038794883X</subfield><subfield code="9">0-387-94883-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)845440392</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025251676</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Downey, R. G.</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1052125417</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parametrized complexity</subfield><subfield code="c">R. G. Downey ; M. R. Fellows</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 533 S.</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">Monographs in computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fellows, M. R.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-019888718</subfield></datafield></record></collection> |
id | DE-604.BV025251676 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:29:43Z |
institution | BVB |
isbn | 038794883X |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-019888718 |
oclc_num | 845440392 |
open_access_boolean | |
owner | DE-11 DE-188 |
owner_facet | DE-11 DE-188 |
physical | XV, 533 S. graph. Darst. |
publishDate | 1999 |
publishDateSearch | 1999 |
publishDateSort | 1999 |
publisher | Springer |
record_format | marc |
series2 | Monographs in computer science |
spelling | Downey, R. G. 1957- Verfasser (DE-588)1052125417 aut Parametrized complexity R. G. Downey ; M. R. Fellows New York [u.a.] Springer 1999 XV, 533 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Monographs in computer science Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf Automat Automatentheorie (DE-588)4831958-2 gnd rswk-swf Algorithmische Programmiersprache (DE-588)4141876-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s DE-604 Parametrisierte Komplexität (DE-588)4818897-9 s Algorithmische Programmiersprache (DE-588)4141876-1 s Algorithmus (DE-588)4001183-5 s Automat Automatentheorie (DE-588)4831958-2 s Fellows, M. R. Sonstige oth |
spellingShingle | Downey, R. G. 1957- Parametrized complexity Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Automat Automatentheorie (DE-588)4831958-2 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd |
subject_GND | (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)4818897-9 (DE-588)4831958-2 (DE-588)4141876-1 |
title | Parametrized complexity |
title_auth | Parametrized complexity |
title_exact_search | Parametrized complexity |
title_full | Parametrized complexity R. G. Downey ; M. R. Fellows |
title_fullStr | Parametrized complexity R. G. Downey ; M. R. Fellows |
title_full_unstemmed | Parametrized complexity R. G. Downey ; M. R. Fellows |
title_short | Parametrized complexity |
title_sort | parametrized complexity |
topic | Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Automat Automatentheorie (DE-588)4831958-2 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd |
topic_facet | Berechnungskomplexität Algorithmus Parametrisierte Komplexität Automat Automatentheorie Algorithmische Programmiersprache |
work_keys_str_mv | AT downeyrg parametrizedcomplexity AT fellowsmr parametrizedcomplexity |