Boolean function complexity:
Gespeichert in:
Format: | Elektronisch E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
1992
|
Schriftenreihe: | London Mathematical Society lecture note series
169 |
Schlagworte: | |
Online-Zugang: | FAW01 FAW02 Volltext |
Beschreibung: | Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society Includes bibliographical references (p. 198-201) |
Beschreibung: | 1 Online-Ressource (201 p.) |
ISBN: | 0511526636 0521408261 1107361729 9780511526633 9780521408264 9781107361720 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043070202 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 151126s1992 |||| o||u| ||||||eng d | ||
020 | |a 0511526636 |c ebook |9 0-511-52663-6 | ||
020 | |a 0521408261 |9 0-521-40826-1 | ||
020 | |a 1107361729 |c electronic bk. |9 1-107-36172-9 | ||
020 | |a 9780511526633 |c ebook |9 978-0-511-52663-3 | ||
020 | |a 9780521408264 |9 978-0-521-40826-4 | ||
020 | |a 9781107361720 |c electronic bk. |9 978-1-107-36172-0 | ||
035 | |a (OCoLC)839304312 | ||
035 | |a (DE-599)BVBBV043070202 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-1046 |a DE-1047 | ||
082 | 0 | |a 511.3/24 |2 22 | |
245 | 1 | 0 | |a Boolean function complexity |c edited by M.S. Paterson |
264 | 1 | |a Cambridge |b Cambridge University Press |c 1992 | |
300 | |a 1 Online-Ressource (201 p.) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a London Mathematical Society lecture note series |v 169 | |
500 | |a Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society | ||
500 | |a Includes bibliographical references (p. 198-201) | ||
650 | 7 | |a Boole, algèbre de / Congrès |2 ram | |
650 | 7 | |a Complexité de calcul (Informatique) / Congrès |2 ram | |
650 | 7 | |a Boolean-functions |2 gtt | |
650 | 7 | |a MATHEMATICS / Algebra / General |2 bisacsh | |
650 | 7 | |a Algebra, Boolean |2 fast | |
650 | 7 | |a Computational complexity |2 fast | |
650 | 4 | |a Computational complexity |v Congresses | |
650 | 4 | |a Algebra, Boolean | |
650 | 0 | 7 | |a Boolesche Funktion |0 (DE-588)4146281-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
689 | 0 | 0 | |a Boolesche Funktion |0 (DE-588)4146281-6 |D s |
689 | 0 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Paterson, Michael S. |e Sonstige |4 oth | |
856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529 |x Aggregator |3 Volltext |
912 | |a ZDB-4-EBA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-028494394 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext |
Datensatz im Suchindex
_version_ | 1804175452744450048 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV043070202 |
collection | ZDB-4-EBA |
ctrlnum | (OCoLC)839304312 (DE-599)BVBBV043070202 |
dewey-full | 511.3/24 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3/24 |
dewey-search | 511.3/24 |
dewey-sort | 3511.3 224 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02629nmm a2200589zcb4500</leader><controlfield tag="001">BV043070202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s1992 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511526636</subfield><subfield code="c">ebook</subfield><subfield code="9">0-511-52663-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521408261</subfield><subfield code="9">0-521-40826-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107361729</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-36172-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511526633</subfield><subfield code="c">ebook</subfield><subfield code="9">978-0-511-52663-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521408264</subfield><subfield code="9">978-0-521-40826-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107361720</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-36172-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)839304312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043070202</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/24</subfield><subfield code="2">22</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Boolean function complexity</subfield><subfield code="c">edited by M.S. Paterson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (201 p.)</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="0" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield><subfield code="v">169</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 198-201)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Boole, algèbre de / Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (Informatique) / Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Boolean-functions</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Algebra / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebra, Boolean</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Paterson, Michael S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028494394</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift gnd-content |
genre_facet | Konferenzschrift |
id | DE-604.BV043070202 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:16:31Z |
institution | BVB |
isbn | 0511526636 0521408261 1107361729 9780511526633 9780521408264 9781107361720 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028494394 |
oclc_num | 839304312 |
open_access_boolean | |
owner | DE-1046 DE-1047 |
owner_facet | DE-1046 DE-1047 |
physical | 1 Online-Ressource (201 p.) |
psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
publisher | Cambridge University Press |
record_format | marc |
series2 | London Mathematical Society lecture note series |
spelling | Boolean function complexity edited by M.S. Paterson Cambridge Cambridge University Press 1992 1 Online-Ressource (201 p.) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 169 Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society Includes bibliographical references (p. 198-201) Boole, algèbre de / Congrès ram Complexité de calcul (Informatique) / Congrès ram Boolean-functions gtt MATHEMATICS / Algebra / General bisacsh Algebra, Boolean fast Computational complexity fast Computational complexity Congresses Algebra, Boolean Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Boolesche Funktion (DE-588)4146281-6 s Komplexität (DE-588)4135369-9 s 1\p DE-604 Paterson, Michael S. Sonstige oth http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Boolean function complexity Boole, algèbre de / Congrès ram Complexité de calcul (Informatique) / Congrès ram Boolean-functions gtt MATHEMATICS / Algebra / General bisacsh Algebra, Boolean fast Computational complexity fast Computational complexity Congresses Algebra, Boolean Boolesche Funktion (DE-588)4146281-6 gnd Komplexität (DE-588)4135369-9 gnd |
subject_GND | (DE-588)4146281-6 (DE-588)4135369-9 (DE-588)1071861417 |
title | Boolean function complexity |
title_auth | Boolean function complexity |
title_exact_search | Boolean function complexity |
title_full | Boolean function complexity edited by M.S. Paterson |
title_fullStr | Boolean function complexity edited by M.S. Paterson |
title_full_unstemmed | Boolean function complexity edited by M.S. Paterson |
title_short | Boolean function complexity |
title_sort | boolean function complexity |
topic | Boole, algèbre de / Congrès ram Complexité de calcul (Informatique) / Congrès ram Boolean-functions gtt MATHEMATICS / Algebra / General bisacsh Algebra, Boolean fast Computational complexity fast Computational complexity Congresses Algebra, Boolean Boolesche Funktion (DE-588)4146281-6 gnd Komplexität (DE-588)4135369-9 gnd |
topic_facet | Boole, algèbre de / Congrès Complexité de calcul (Informatique) / Congrès Boolean-functions MATHEMATICS / Algebra / General Algebra, Boolean Computational complexity Computational complexity Congresses Boolesche Funktion Komplexität Konferenzschrift |
url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552529 |
work_keys_str_mv | AT patersonmichaels booleanfunctioncomplexity |