Boolean function complexity: advances and frontiers
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Schriftenreihe: | Algorithms and combinatorics
27 |
| Schlagworte: | |
| Online-Zugang: | BTU01 TUM01 UBA01 UBM01 UBT01 UBW01 UER01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9783642245077 9783642245084 |
| DOI: | 10.1007/978-3-642-24508-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV039858700 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 120201s2012 |||| o||u| ||||||eng d | ||
| 015 | |a 12,O02 |2 dnb | ||
| 020 | |a 9783642245077 |9 978-3-642-24507-7 | ||
| 020 | |a 9783642245084 |c Online |9 978-3-642-24508-4 | ||
| 024 | 7 | |a 10.1007/978-3-642-24508-4 |2 doi | |
| 024 | 3 | |a 9783642245084 | |
| 035 | |a (OCoLC)780368141 | ||
| 035 | |a (DE-599)DNB1018509062 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 |a DE-20 |a DE-703 |a DE-19 |a DE-91 |a DE-29 |a DE-739 |a DE-384 |a DE-83 | ||
| 082 | 0 | |a 621.395 |2 22/ger | |
| 082 | 0 | |a 004.01511326 |2 22/ger | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Jukna, Stasys |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Boolean function complexity |b advances and frontiers |c Stasys Jukna |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and combinatorics |v 27 | |
| 650 | 0 | 7 | |a Schaltfunktion |0 (DE-588)4209765-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Binäres Entscheidungsdiagramm |0 (DE-588)4530728-3 |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 Beweissystem |0 (DE-588)4711800-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 653 | |a Electronic book text | ||
| 653 | |a Graduate | ||
| 653 | |a Boolean functions | ||
| 653 | |a circuit complexity | ||
| 653 | |a communication complexity | ||
| 653 | |a lower bounds | ||
| 689 | 0 | 0 | |a Boolesche Funktion |0 (DE-588)4146281-6 |D s |
| 689 | 0 | 1 | |a Schaltfunktion |0 (DE-588)4209765-4 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 3 | |a Binäres Entscheidungsdiagramm |0 (DE-588)4530728-3 |D s |
| 689 | 0 | 4 | |a Beweissystem |0 (DE-588)4711800-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Algorithms and combinatorics |v 27 |w (DE-604)BV023819262 |9 27 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-24508-4 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024718302 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l BTU01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l TUM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UBA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UBM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UBT01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UBW01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UER01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-24508-4 |l UPA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148796194553856 |
|---|---|
| any_adam_object | |
| author | Jukna, Stasys |
| author_facet | Jukna, Stasys |
| author_role | aut |
| author_sort | Jukna, Stasys |
| author_variant | s j sj |
| building | Verbundindex |
| bvnumber | BV039858700 |
| classification_rvk | SK 170 ST 134 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA |
| ctrlnum | (OCoLC)780368141 (DE-599)DNB1018509062 |
| dewey-full | 621.395 004.01511326 |
| dewey-hundreds | 600 - Technology (Applied sciences) 000 - Computer science, information, general works |
| dewey-ones | 621 - Applied physics 004 - Computer science |
| dewey-raw | 621.395 004.01511326 |
| dewey-search | 621.395 004.01511326 |
| dewey-sort | 3621.395 |
| dewey-tens | 620 - Engineering and allied operations 000 - Computer science, information, general works |
| discipline | Informatik Mathematik Elektrotechnik / Elektronik / Nachrichtentechnik |
| doi_str_mv | 10.1007/978-3-642-24508-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02977nmm a2200709zcb4500</leader><controlfield tag="001">BV039858700</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120201s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,O02</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642245077</subfield><subfield code="9">978-3-642-24507-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642245084</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-24508-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-24508-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642245084</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)780368141</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1018509062</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-634</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.395</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.01511326</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jukna, Stasys</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Boolean function complexity</subfield><subfield code="b">advances and frontiers</subfield><subfield code="c">Stasys Jukna</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">27</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltfunktion</subfield><subfield code="0">(DE-588)4209765-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Binäres Entscheidungsdiagramm</subfield><subfield code="0">(DE-588)4530728-3</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">Beweissystem</subfield><subfield code="0">(DE-588)4711800-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Electronic book text</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graduate</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Boolean functions</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">circuit complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">communication complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">lower bounds</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Schaltfunktion</subfield><subfield code="0">(DE-588)4209765-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Binäres Entscheidungsdiagramm</subfield><subfield code="0">(DE-588)4530728-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Beweissystem</subfield><subfield code="0">(DE-588)4711800-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">27</subfield><subfield code="w">(DE-604)BV023819262</subfield><subfield code="9">27</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024718302</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-24508-4</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039858700 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:12:49Z |
| institution | BVB |
| isbn | 9783642245077 9783642245084 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024718302 |
| oclc_num | 780368141 |
| open_access_boolean | |
| owner | DE-634 DE-20 DE-703 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-29 DE-739 DE-384 DE-83 |
| owner_facet | DE-634 DE-20 DE-703 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-29 DE-739 DE-384 DE-83 |
| physical | 1 Online-Ressource |
| psigel | ZDB-2-SMA |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and combinatorics |
| series2 | Algorithms and combinatorics |
| spelling | Jukna, Stasys Verfasser aut Boolean function complexity advances and frontiers Stasys Jukna Berlin [u.a.] Springer 2012 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Algorithms and combinatorics 27 Schaltfunktion (DE-588)4209765-4 gnd rswk-swf Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd rswk-swf Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Beweissystem (DE-588)4711800-3 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Electronic book text Graduate Boolean functions circuit complexity communication complexity lower bounds Boolesche Funktion (DE-588)4146281-6 s Schaltfunktion (DE-588)4209765-4 s Berechnungskomplexität (DE-588)4134751-1 s Binäres Entscheidungsdiagramm (DE-588)4530728-3 s Beweissystem (DE-588)4711800-3 s DE-604 Algorithms and combinatorics 27 (DE-604)BV023819262 27 https://doi.org/10.1007/978-3-642-24508-4 Verlag Volltext |
| spellingShingle | Jukna, Stasys Boolean function complexity advances and frontiers Algorithms and combinatorics Schaltfunktion (DE-588)4209765-4 gnd Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd Boolesche Funktion (DE-588)4146281-6 gnd Beweissystem (DE-588)4711800-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4209765-4 (DE-588)4530728-3 (DE-588)4146281-6 (DE-588)4711800-3 (DE-588)4134751-1 |
| title | Boolean function complexity advances and frontiers |
| title_auth | Boolean function complexity advances and frontiers |
| title_exact_search | Boolean function complexity advances and frontiers |
| title_full | Boolean function complexity advances and frontiers Stasys Jukna |
| title_fullStr | Boolean function complexity advances and frontiers Stasys Jukna |
| title_full_unstemmed | Boolean function complexity advances and frontiers Stasys Jukna |
| title_short | Boolean function complexity |
| title_sort | boolean function complexity advances and frontiers |
| title_sub | advances and frontiers |
| topic | Schaltfunktion (DE-588)4209765-4 gnd Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd Boolesche Funktion (DE-588)4146281-6 gnd Beweissystem (DE-588)4711800-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Schaltfunktion Binäres Entscheidungsdiagramm Boolesche Funktion Beweissystem Berechnungskomplexität |
| url | https://doi.org/10.1007/978-3-642-24508-4 |
| volume_link | (DE-604)BV023819262 |
| work_keys_str_mv | AT juknastasys booleanfunctioncomplexityadvancesandfrontiers |