Lower bounds for recognizing small cliques on CRCW PRAM's:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Inst. of Technology
1987
|
| Schlagworte: | |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021891304 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 900621s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)18484648 | ||
| 035 | |a (DE-599)BVBBV021891304 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-336 | ||
| 100 | 1 | |a Beame, Paul W. |d 1959- |e Verfasser |0 (DE-588)138768587 |4 aut | |
| 245 | 1 | 0 | |a Lower bounds for recognizing small cliques on CRCW PRAM's |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Inst. of Technology |c 1987 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Random access memory | |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Boolesche Funktion |0 (DE-588)4146281-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelrechner |0 (DE-588)4173280-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Boolesche Funktion |0 (DE-588)4146281-6 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Parallelrechner |0 (DE-588)4173280-7 |D s |
| 689 | 5 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015106505 | ||
Datensatz im Suchindex
| _version_ | 1804135834608205824 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Beame, Paul W. 1959- |
| author_GND | (DE-588)138768587 |
| author_facet | Beame, Paul W. 1959- |
| author_role | aut |
| author_sort | Beame, Paul W. 1959- |
| author_variant | p w b pw pwb |
| building | Verbundindex |
| bvnumber | BV021891304 |
| ctrlnum | (OCoLC)18484648 (DE-599)BVBBV021891304 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01670nam a2200493zc 4500</leader><controlfield tag="001">BV021891304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900621s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18484648</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021891304</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-336</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beame, Paul W.</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138768587</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lower bounds for recognizing small cliques on CRCW PRAM's</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Inst. of Technology</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="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random access memory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015106505</subfield></datafield></record></collection> |
| id | DE-604.BV021891304 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:11Z |
| indexdate | 2024-07-09T20:46:48Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015106505 |
| oclc_num | 18484648 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 17 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Laboratory for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Beame, Paul W. 1959- Verfasser (DE-588)138768587 aut Lower bounds for recognizing small cliques on CRCW PRAM's Cambridge, Mass. Laboratory for Computer Science, Massachusetts Inst. of Technology 1987 17 S. txt rdacontent n rdamedia nc rdacarrier Parallel processing (Electronic computers) Random access memory Approximation (DE-588)4002498-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Parallelrechner (DE-588)4173280-7 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Approximation (DE-588)4002498-2 s Graph (DE-588)4021842-9 s Polynom (DE-588)4046711-9 s Boolesche Funktion (DE-588)4146281-6 s Parallelrechner (DE-588)4173280-7 s |
| spellingShingle | Beame, Paul W. 1959- Lower bounds for recognizing small cliques on CRCW PRAM's Parallel processing (Electronic computers) Random access memory Approximation (DE-588)4002498-2 gnd Algorithmus (DE-588)4001183-5 gnd Boolesche Funktion (DE-588)4146281-6 gnd Parallelrechner (DE-588)4173280-7 gnd Graph (DE-588)4021842-9 gnd Polynom (DE-588)4046711-9 gnd |
| subject_GND | (DE-588)4002498-2 (DE-588)4001183-5 (DE-588)4146281-6 (DE-588)4173280-7 (DE-588)4021842-9 (DE-588)4046711-9 |
| title | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_auth | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_exact_search | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_exact_search_txtP | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_full | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_fullStr | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_full_unstemmed | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_short | Lower bounds for recognizing small cliques on CRCW PRAM's |
| title_sort | lower bounds for recognizing small cliques on crcw pram s |
| topic | Parallel processing (Electronic computers) Random access memory Approximation (DE-588)4002498-2 gnd Algorithmus (DE-588)4001183-5 gnd Boolesche Funktion (DE-588)4146281-6 gnd Parallelrechner (DE-588)4173280-7 gnd Graph (DE-588)4021842-9 gnd Polynom (DE-588)4046711-9 gnd |
| topic_facet | Parallel processing (Electronic computers) Random access memory Approximation Algorithmus Boolesche Funktion Parallelrechner Graph Polynom |
| work_keys_str_mv | AT beamepaulw lowerboundsforrecognizingsmallcliquesoncrcwprams |