Polynomial-time self-reducibility: theoretical motivations and practical results
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Knoxville
1987
|
Schriftenreihe: | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS
1987,171 |
Schlagworte: | |
Beschreibung: | 17 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008949803 | ||
003 | DE-604 | ||
005 | 19960215 | ||
007 | t | ||
008 | 940206s1987 |||| 00||| eng d | ||
035 | |a (OCoLC)31771658 | ||
035 | |a (DE-599)BVBBV008949803 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
050 | 0 | |a QA267.7 | |
100 | 1 | |a Brown, Donna J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Polynomial-time self-reducibility |b theoretical motivations and practical results |c Donna J. Brown ; Michael R. Fellows ; Michael A. Langston |
264 | 1 | |a Knoxville |c 1987 | |
300 | |a 17 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |v 1987,171 | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Computational complexity | |
700 | 1 | |a Fellows, Michael R. |e Verfasser |4 aut | |
700 | 1 | |a Langston, Michael A. |e Verfasser |4 aut | |
810 | 2 | |a Computer Science Department: CS |t University of Tennessee <Knoxville, Tenn.> |v 1987,171 |w (DE-604)BV008903301 |9 1987,171 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005905436 |
Datensatz im Suchindex
_version_ | 1804123282995150848 |
---|---|
any_adam_object | |
author | Brown, Donna J. Fellows, Michael R. Langston, Michael A. |
author_facet | Brown, Donna J. Fellows, Michael R. Langston, Michael A. |
author_role | aut aut aut |
author_sort | Brown, Donna J. |
author_variant | d j b dj djb m r f mr mrf m a l ma mal |
building | Verbundindex |
bvnumber | BV008949803 |
callnumber-first | Q - Science |
callnumber-label | QA267 |
callnumber-raw | QA267.7 |
callnumber-search | QA267.7 |
callnumber-sort | QA 3267.7 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)31771658 (DE-599)BVBBV008949803 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01150nam a2200325 cb4500</leader><controlfield tag="001">BV008949803</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960215 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31771658</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949803</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="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brown, Donna J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polynomial-time self-reducibility</subfield><subfield code="b">theoretical motivations and practical results</subfield><subfield code="c">Donna J. Brown ; Michael R. Fellows ; Michael A. Langston</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Knoxville</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS</subfield><subfield code="v">1987,171</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fellows, Michael R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Langston, Michael A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">University of Tennessee <Knoxville, Tenn.></subfield><subfield code="v">1987,171</subfield><subfield code="w">(DE-604)BV008903301</subfield><subfield code="9">1987,171</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905436</subfield></datafield></record></collection> |
id | DE-604.BV008949803 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:18Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905436 |
oclc_num | 31771658 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 17 S. |
publishDate | 1987 |
publishDateSearch | 1987 |
publishDateSort | 1987 |
record_format | marc |
series2 | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |
spelling | Brown, Donna J. Verfasser aut Polynomial-time self-reducibility theoretical motivations and practical results Donna J. Brown ; Michael R. Fellows ; Michael A. Langston Knoxville 1987 17 S. txt rdacontent n rdamedia nc rdacarrier University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS 1987,171 Algorithms Computational complexity Fellows, Michael R. Verfasser aut Langston, Michael A. Verfasser aut Computer Science Department: CS University of Tennessee <Knoxville, Tenn.> 1987,171 (DE-604)BV008903301 1987,171 |
spellingShingle | Brown, Donna J. Fellows, Michael R. Langston, Michael A. Polynomial-time self-reducibility theoretical motivations and practical results Algorithms Computational complexity |
title | Polynomial-time self-reducibility theoretical motivations and practical results |
title_auth | Polynomial-time self-reducibility theoretical motivations and practical results |
title_exact_search | Polynomial-time self-reducibility theoretical motivations and practical results |
title_full | Polynomial-time self-reducibility theoretical motivations and practical results Donna J. Brown ; Michael R. Fellows ; Michael A. Langston |
title_fullStr | Polynomial-time self-reducibility theoretical motivations and practical results Donna J. Brown ; Michael R. Fellows ; Michael A. Langston |
title_full_unstemmed | Polynomial-time self-reducibility theoretical motivations and practical results Donna J. Brown ; Michael R. Fellows ; Michael A. Langston |
title_short | Polynomial-time self-reducibility |
title_sort | polynomial time self reducibility theoretical motivations and practical results |
title_sub | theoretical motivations and practical results |
topic | Algorithms Computational complexity |
topic_facet | Algorithms Computational complexity |
volume_link | (DE-604)BV008903301 |
work_keys_str_mv | AT browndonnaj polynomialtimeselfreducibilitytheoreticalmotivationsandpracticalresults AT fellowsmichaelr polynomialtimeselfreducibilitytheoreticalmotivationsandpracticalresults AT langstonmichaela polynomialtimeselfreducibilitytheoreticalmotivationsandpracticalresults |