On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets):
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Toronto
Univ. of Toronto, Dep. of Computer Science
1988
|
Schriftenreihe: | University <Toronto> / Department of Computer Science: Technical report
208 |
Schlagworte: | |
Beschreibung: | Getr. Zählung graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011842177 | ||
003 | DE-604 | ||
005 | 20010702 | ||
007 | t | ||
008 | 980320s1988 d||| |||| 00||| und d | ||
035 | |a (OCoLC)634833419 | ||
035 | |a (DE-599)BVBBV011842177 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | |a und | ||
049 | |a DE-91G | ||
084 | |a DAT 542f |2 stub | ||
084 | |a DAT 703f |2 stub | ||
084 | |a DAT 517f |2 stub | ||
100 | 1 | |a Godbeer, Gail H. |e Verfasser |4 aut | |
245 | 1 | 0 | |a On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) |c Gail H. Godbeer ; John Lipscomb ; Michael Luby |
264 | 1 | |a Toronto |b Univ. of Toronto, Dep. of Computer Science |c 1988 | |
300 | |a Getr. Zählung |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Toronto> / Department of Computer Science: Technical report |v 208 | |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Konnektionismus |0 (DE-588)4265446-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | 1 | |a Konnektionismus |0 (DE-588)4265446-4 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Lipscomb, John |e Verfasser |4 aut | |
700 | 1 | |a Luby, Michael |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Technical report |t University <Toronto> |v 208 |w (DE-604)BV005455013 |9 208 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007997759 |
Datensatz im Suchindex
_version_ | 1804126385352998912 |
---|---|
any_adam_object | |
author | Godbeer, Gail H. Lipscomb, John Luby, Michael |
author_facet | Godbeer, Gail H. Lipscomb, John Luby, Michael |
author_role | aut aut aut |
author_sort | Godbeer, Gail H. |
author_variant | g h g gh ghg j l jl m l ml |
building | Verbundindex |
bvnumber | BV011842177 |
classification_tum | DAT 542f DAT 703f DAT 517f |
ctrlnum | (OCoLC)634833419 (DE-599)BVBBV011842177 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01466nam a2200385 cb4500</leader><controlfield tag="001">BV011842177</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010702 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980320s1988 d||| |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634833419</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011842177</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 703f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Godbeer, Gail H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets)</subfield><subfield code="c">Gail H. Godbeer ; John Lipscomb ; Michael Luby</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Toronto</subfield><subfield code="b">Univ. of Toronto, Dep. of Computer Science</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Getr. Zählung</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="1" ind2=" "><subfield code="a">University <Toronto> / Department of Computer Science: Technical report</subfield><subfield code="v">208</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konnektionismus</subfield><subfield code="0">(DE-588)4265446-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Konnektionismus</subfield><subfield code="0">(DE-588)4265446-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lipscomb, John</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luby, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University <Toronto></subfield><subfield code="v">208</subfield><subfield code="w">(DE-604)BV005455013</subfield><subfield code="9">208</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007997759</subfield></datafield></record></collection> |
id | DE-604.BV011842177 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:16:37Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007997759 |
oclc_num | 634833419 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | Getr. Zählung graph. Darst. |
publishDate | 1988 |
publishDateSearch | 1988 |
publishDateSort | 1988 |
publisher | Univ. of Toronto, Dep. of Computer Science |
record_format | marc |
series2 | University <Toronto> / Department of Computer Science: Technical report |
spelling | Godbeer, Gail H. Verfasser aut On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Gail H. Godbeer ; John Lipscomb ; Michael Luby Toronto Univ. of Toronto, Dep. of Computer Science 1988 Getr. Zählung graph. Darst. txt rdacontent n rdamedia nc rdacarrier University <Toronto> / Department of Computer Science: Technical report 208 Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Konnektionismus (DE-588)4265446-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s Konnektionismus (DE-588)4265446-4 s DE-604 Lipscomb, John Verfasser aut Luby, Michael Verfasser aut Department of Computer Science: Technical report University <Toronto> 208 (DE-604)BV005455013 208 |
spellingShingle | Godbeer, Gail H. Lipscomb, John Luby, Michael On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Komplexitätstheorie (DE-588)4120591-1 gnd Konnektionismus (DE-588)4265446-4 gnd |
subject_GND | (DE-588)4120591-1 (DE-588)4265446-4 |
title | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) |
title_auth | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) |
title_exact_search | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) |
title_full | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Gail H. Godbeer ; John Lipscomb ; Michael Luby |
title_fullStr | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Gail H. Godbeer ; John Lipscomb ; Michael Luby |
title_full_unstemmed | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Gail H. Godbeer ; John Lipscomb ; Michael Luby |
title_short | On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) |
title_sort | on the computational complexity of finding stable state vectors in connectionist models hopfield nets |
topic | Komplexitätstheorie (DE-588)4120591-1 gnd Konnektionismus (DE-588)4265446-4 gnd |
topic_facet | Komplexitätstheorie Konnektionismus |
volume_link | (DE-604)BV005455013 |
work_keys_str_mv | AT godbeergailh onthecomputationalcomplexityoffindingstablestatevectorsinconnectionistmodelshopfieldnets AT lipscombjohn onthecomputationalcomplexityoffindingstablestatevectorsinconnectionistmodelshopfieldnets AT lubymichael onthecomputationalcomplexityoffindingstablestatevectorsinconnectionistmodelshopfieldnets |