The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda):
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Frankfurt am Main
Fachbereich Informatik, Univ.
1990
|
Schriftenreihe: | Interner Bericht / Fachbereich Informatik, Universität Frankfurt
1990,2 |
Beschreibung: | 24 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV004134963 | ||
003 | DE-604 | ||
005 | 20170111 | ||
007 | t | ||
008 | 901008s1990 gw |||| 00||| eng d | ||
035 | |a (OCoLC)613522083 | ||
035 | |a (DE-599)BVBBV004134963 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-12 |a DE-29T |a DE-91G | ||
100 | 1 | |a Lenz, Katja |d 1960- |e Verfasser |0 (DE-588)1145642772 |4 aut | |
245 | 1 | 0 | |a The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |c Katja Lenz |
264 | 1 | |a Frankfurt am Main |b Fachbereich Informatik, Univ. |c 1990 | |
300 | |a 24 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Interner Bericht / Fachbereich Informatik, Universität Frankfurt |v 1990,2 | |
810 | 2 | |a Fachbereich Informatik, Universität Frankfurt |t Interner Bericht |v 1990,2 |w (DE-604)BV000600974 |9 1990,2 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002579776 |
Datensatz im Suchindex
_version_ | 1804118349662126080 |
---|---|
any_adam_object | |
author | Lenz, Katja 1960- |
author_GND | (DE-588)1145642772 |
author_facet | Lenz, Katja 1960- |
author_role | aut |
author_sort | Lenz, Katja 1960- |
author_variant | k l kl |
building | Verbundindex |
bvnumber | BV004134963 |
ctrlnum | (OCoLC)613522083 (DE-599)BVBBV004134963 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00998nam a2200277 cb4500</leader><controlfield tag="001">BV004134963</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170111 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901008s1990 gw |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)613522083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004134963</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lenz, Katja</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1145642772</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda)</subfield><subfield code="c">Katja Lenz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Frankfurt am Main</subfield><subfield code="b">Fachbereich Informatik, Univ.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 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">Interner Bericht / Fachbereich Informatik, Universität Frankfurt</subfield><subfield code="v">1990,2</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik, Universität Frankfurt</subfield><subfield code="t">Interner Bericht</subfield><subfield code="v">1990,2</subfield><subfield code="w">(DE-604)BV000600974</subfield><subfield code="9">1990,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002579776</subfield></datafield></record></collection> |
id | DE-604.BV004134963 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T16:08:53Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002579776 |
oclc_num | 613522083 |
open_access_boolean | |
owner | DE-12 DE-29T DE-91G DE-BY-TUM |
owner_facet | DE-12 DE-29T DE-91G DE-BY-TUM |
physical | 24 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Fachbereich Informatik, Univ. |
record_format | marc |
series2 | Interner Bericht / Fachbereich Informatik, Universität Frankfurt |
spelling | Lenz, Katja 1960- Verfasser (DE-588)1145642772 aut The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) Katja Lenz Frankfurt am Main Fachbereich Informatik, Univ. 1990 24 S. txt rdacontent n rdamedia nc rdacarrier Interner Bericht / Fachbereich Informatik, Universität Frankfurt 1990,2 Fachbereich Informatik, Universität Frankfurt Interner Bericht 1990,2 (DE-604)BV000600974 1990,2 |
spellingShingle | Lenz, Katja 1960- The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |
title | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |
title_auth | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |
title_exact_search | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |
title_full | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) Katja Lenz |
title_fullStr | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) Katja Lenz |
title_full_unstemmed | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) Katja Lenz |
title_short | The complexity of symmetric Boolean functions in bounded depth circuits over the basis (Lambda) |
title_sort | the complexity of symmetric boolean functions in bounded depth circuits over the basis lambda |
volume_link | (DE-604)BV000600974 |
work_keys_str_mv | AT lenzkatja thecomplexityofsymmetricbooleanfunctionsinboundeddepthcircuitsoverthebasislambda |