The complexity of computing symmetric functions using threshold circuits:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Seattle, Wash.
1990
|
Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,1,1 |
Beschreibung: | 14 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009260381 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)552632477 | ||
035 | |a (DE-599)BVBBV009260381 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Beame, Paul W. |d 1959- |e Verfasser |0 (DE-588)138768587 |4 aut | |
245 | 1 | 0 | |a The complexity of computing symmetric functions using threshold circuits |c Paul Beame ; Erik Brisson ; Richard Ladner |
264 | 1 | |a Seattle, Wash. |c 1990 | |
300 | |a 14 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 90,1,1 | |
700 | 1 | |a Brisson, Erik |e Verfasser |4 aut | |
700 | 1 | |a Ladner, Richard |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,1,1 |w (DE-604)BV008930431 |9 90,1,1 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006162257 |
Datensatz im Suchindex
_version_ | 1804123708271362048 |
---|---|
any_adam_object | |
author | Beame, Paul W. 1959- Brisson, Erik Ladner, Richard |
author_GND | (DE-588)138768587 |
author_facet | Beame, Paul W. 1959- Brisson, Erik Ladner, Richard |
author_role | aut aut aut |
author_sort | Beame, Paul W. 1959- |
author_variant | p w b pw pwb e b eb r l rl |
building | Verbundindex |
bvnumber | BV009260381 |
ctrlnum | (OCoLC)552632477 (DE-599)BVBBV009260381 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01085nam a2200289 cb4500</leader><controlfield tag="001">BV009260381</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)552632477</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260381</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="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">The complexity of computing symmetric functions using threshold circuits</subfield><subfield code="c">Paul Beame ; Erik Brisson ; Richard Ladner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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 Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">90,1,1</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brisson, Erik</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ladner, Richard</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 of Washington <Seattle, Wash.></subfield><subfield code="v">90,1,1</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,1,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162257</subfield></datafield></record></collection> |
id | DE-604.BV009260381 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:34:04Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162257 |
oclc_num | 552632477 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 14 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
spelling | Beame, Paul W. 1959- Verfasser (DE-588)138768587 aut The complexity of computing symmetric functions using threshold circuits Paul Beame ; Erik Brisson ; Richard Ladner Seattle, Wash. 1990 14 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,1,1 Brisson, Erik Verfasser aut Ladner, Richard Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,1,1 (DE-604)BV008930431 90,1,1 |
spellingShingle | Beame, Paul W. 1959- Brisson, Erik Ladner, Richard The complexity of computing symmetric functions using threshold circuits |
title | The complexity of computing symmetric functions using threshold circuits |
title_auth | The complexity of computing symmetric functions using threshold circuits |
title_exact_search | The complexity of computing symmetric functions using threshold circuits |
title_full | The complexity of computing symmetric functions using threshold circuits Paul Beame ; Erik Brisson ; Richard Ladner |
title_fullStr | The complexity of computing symmetric functions using threshold circuits Paul Beame ; Erik Brisson ; Richard Ladner |
title_full_unstemmed | The complexity of computing symmetric functions using threshold circuits Paul Beame ; Erik Brisson ; Richard Ladner |
title_short | The complexity of computing symmetric functions using threshold circuits |
title_sort | the complexity of computing symmetric functions using threshold circuits |
volume_link | (DE-604)BV008930431 |
work_keys_str_mv | AT beamepaulw thecomplexityofcomputingsymmetricfunctionsusingthresholdcircuits AT brissonerik thecomplexityofcomputingsymmetricfunctionsusingthresholdcircuits AT ladnerrichard thecomplexityofcomputingsymmetricfunctionsusingthresholdcircuits |