Boolean functions and computation models:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2002
|
| Schriftenreihe: | Texts in theoretical computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 601 S. graph. Darst. |
| ISBN: | 3540594361 |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV013738581 | ||
| 003 | DE-604 | ||
| 005 | 20060906 | ||
| 007 | t | ||
| 008 | 010515s2002 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 961200553 |2 DE-101 | |
| 020 | |a 3540594361 |9 3-540-59436-1 | ||
| 035 | |a (OCoLC)46791075 | ||
| 035 | |a (DE-599)BVBBV013738581 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-703 |a DE-20 |a DE-91G |a DE-19 |a DE-M347 |a DE-384 |a DE-634 |a DE-11 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a DAT 195f |2 stub | ||
| 100 | 1 | |a Clote, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Boolean functions and computation models |c Peter Clote ; Evangelos Kranakis |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2002 | |
| 300 | |a XIV, 601 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in theoretical computer science | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 4 | |a Boole, Algèbre de | |
| 650 | 7 | |a Boolean-functions |2 gtt | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Boolesche Funktion |0 (DE-588)4146281-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematisches Modell |0 (DE-588)4114528-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 0 | 1 | |a Mathematisches Modell |0 (DE-588)4114528-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Boolesche Funktion |0 (DE-588)4146281-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Kranakis, Evangelos |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009390946&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009390946 | ||
Datensatz im Suchindex
| _version_ | 1804128557485522944 |
|---|---|
| adam_text | PETER CLOTE * EVANGELOS KRANAKIS BOOLEAN FUNCTIONS AND COMPUTATION
MODELS WITH 19 FIGURES SPRINGER * CONTENTS 1. BOOLEAN FUNCTIONS AND
CIRCUITS 1 1.1 INTRODUCTION 1 1.2 BOOLEAN FUNCTIONS AND FORMULAS 2 1.3
CIRCUIT MODEL 7 1.4 BASIC FUNCTIONS AND REDUCTIONS 8 1.5 NOMENCLATURE 11
1.6 PARSING REGULAR AND CONTEXT-FREE LANGUAGES 12 1.7 CIRCUITS FOR
INTEGER ARITHMETIC 17 1.7.1 CIRCUITS FOR ADDITION AND MULTIPLICATION 17
1.7.2 DIVISION USING NEWTON ITERATION 21 1.7.3 DIVISION USING ITERATED
PRODUCT 24 1.8 SYNTHESIS OF CIRCUITS 30 1.8.1 ELEMENTARY METHODS 30
1.8.2 SHANNON S METHOD 31 1.8.3 LUPANOV S METHOD 32 1.8.4 SYMMETRIC
FUNCTIONS 34 1.9 REDUCING THE FAN-OUT 35 1.10 RELATING FORMULA SIZE AND
DEPTH 39 1.11 OTHER MODELS 45 1.11.1 SWITCHING NETWORKS 45 1.11.2 VLSI
CIRCUITS 45 1.11.3 ENERGY CONSUMPTION 45 1.11.4 BOOLEAN CELLULAR
AUTOMATA 46 1.11.5 BRANCHING PROGRAMS 48 1.11.6 HOPFIELD NETS 53 1.11.7
COMMUNICATION COMPLEXITY 54 1.11.8 ANONYMOUS NETWORKS 54 1.12 HISTORICAL
AND BIBLIOGRAPHICAL REMARKS 55 1.13 EXERCISES 56 2. CIRCUIT LOWER BOUNDS
61 2.1 INTRODUCTION 61 2.2 SHANNON S LOWER BOUND 63 2.3 NECHIPORUK S
BOUND 65 XII CONTENTS 2.4 MONOTONIC REAL CIRCUITS 68 2.4.1 BROKEN
MOSQUITO SCREEN 68 2.4.2 MONOTONIC REAL CIRCUITS ARE POWERFUL 77 2.4.3
SI-CONNECTIVITY 78 2.5 PARITY AND THE RANDOM RESTRICTION METHOD 90 2.6
PROBABILISTIC METHODS 95 2.6.1 HASTAD S LOWER BOUND FOR PARITY 96 2.6.2
DEPTH-/C VERSUS DEPTH-(FC - 1) 99 2.6.3 RAZBOROV S SIMPLIFICATION AND
DECISION TREES 102 2.6.4 A HYBRID SWITCHING LEMMA AND SI-CONNECTIVITY
107 2.6.5 HYBRID SWITCHING WITH THE UNIFORM DISTRIBUTION 110 2.7
ALGEBRAIC METHODS 124 2.7.1 RAZBOROV S LOWER BOUND FOR MAJORITY OVER
BOOLEAN CIRCUITS WITH PARITY 124 2.7.2 SMOLENSKY S LOWER BOUND FOR MOD P
VERSUS MOD ? .... 129 2.8 POLYNOMIAL METHOD 132 2.8.1 ON THE STRENGTH OF
MOD M GATES 132 2.8.2 THE MOD M -DEGREE OF THRESHOLD FUNCTIONS 135 2.9
METHOD OF FILTERS 137 2.10 ELIMINATING MAJORITY GATES 140 2.11 CIRCUITS
FOR SYMMETRIC FUNCTIONS 141 2.11.1 NEGATIVE RESULTS 143 2.11.2 POSITIVE
RESULTS 145 2.12 PROBABILISTIC CIRCUITS 146 2.13 HISTORICAL AND
BIBLIOGRAPHICAL REMARKS 148 2.14 EXERCISES 150 3. CIRCUIT UPPER BOUNDS
155 3.1 INTRODUCTION 155 3.2 DEFINITIONS AND ELEMENTARY PROPERTIES 156
3.3 POLYA S ENUMERATION THEORY 162 3.4 REPRESENTABILITY OF PERMUTATION
GROUPS 164 3.5 ALGORITHM FOR REPRESENTING CYCLIC GROUPS 168 3.6
ASYMPTOTICS FOR INVARIANCE GROUPS 172 3.7 ALMOST SYMMETRIC LANGUAGES 174
3.8 SYMMETRY AND COMPLEXITY 178 3.9 APPLICATIONS TO ANONYMOUS NETWORKS
184 3.9.1 RINGS 185 3.9.2 HYPERCUBES 185 3.10 HISTORICAL AND
BIBLIOGRAPHICAL REMARKS 194 3.11 EXERCISES 194 4. RANDOMNESS AND
SATISFIABILITY 207 4.1 INTRODUCTION * 207 4.2 THRESHOLD FOR 2-SAT 209
CONTENTS XIII 4.3 UNSATISFIABILITY THRESHOLD FOR 3-SAT 212 4.3.1 A
GENERAL METHOD AND LOCAL MAXIMA 213 4.3.2 METHOD OF SINGLE FLIPS 214
4.3.3 APPROXIMATING THE THRESHOLD 217 4.3.4 METHOD OF DOUBLE FLIPS 217
4.3.5 PROBABILITY CALCULATIONS 218 4.4 SATISFIABILITY THRESHOLD FOR
3-SAT 224 4.4.1 SATISFIABILITY HEURISTICS 224 4.4.2 THRESHOLD 226 4.5 (2
+ P)-SAT 229 4.5.1 UNSATISFIABILITY THRESHOLD 230 4.5.2 TRANSITION FROM
2-SAT TO 3-SAT 232 4.6 CONSTRAINT PROGRAMMING 235 4.6.1 MODELS OF CSP
236 4.6.2 A NEW MODEL FOR RANDOM CSP 238 4.6.3 THE METHOD OF LOCAL
MAXIMA 239 4.6.4 THRESHOLD FOR MODEL E 241 4.7 HISTORICAL AND
BIBLIOGRAPHICAL REMARKS 242 4.8 EXERCISES 243 5. PROPOSITIONAL PROOF
SYSTEMS 247 5.1 INTRODUCTION 247 5.2 COMPLEXITY OF PROOFS 249 5.3
GENTZEN SEQUENT CALCULUS LK 255 5.3.1 COMPLETENESS 257 5.3.2 LOWER BOUND
FOR CUT-FREE GENTZEN 259 5.3.3 MONOTONIC SEQUENT CALCULUS 267 5.4
RESOLUTION 268 5.4.1 RESOLUTION AND THE PHP . . . : 271 5.4.2 RESOLUTION
AND ODD-CHARGED GRAPHS 279 5.4.3 SCHONING S EXPANDER GRAPHS AND
RESOLUTION 285 5.4.4 WIDTH-BOUNDED RESOLUTION PROOFS 291 5.4.5
INTERPOLATION AND SI-CONNECTIVITY 296 5.4.6 PHASE TRANSITION AND LENGTH
OF RESOLUTION PROOFS .... 300 5.5 ALGEBRAIC REFUTATION SYSTEMS 306 5.5.1
NULLSTELLENSATZ 308 5.5.2 POLYNOMIAL CALCULUS . 316 5.5.3 GAUSSIAN
CALCULUS 324 5.5.4 BINOMIAL CALCULUS 326 5.5.5 LOWER BOUNDS FOR THE
POLYNOMIAL CALCULUS 332 5.5.6 RANDOM CNF FORMULAS AND THE POLYNOMIAL
CALCULUS . . 337 5.6 CUTTING PLANES CP 343 5.6.1 COMPLETENESS OF CP 345
5.6.2 CUTTING PLANES AND THE PHP 348 5.6.3 POLYNOMIAL EQUIVALENCE OF CP2
AND CP 353 XIV CONTENTS 5.6.4 NORMAL FORM FOR CP PROOFS 355 5.6.5 LOWER
BOUNDS FOR CP 359 5.6.6 THRESHOLD LOGIC PTK 366 5.7 FREGE SYSTEMS 370
5.7.1 BOUNDED DEPTH FREGE SYSTEMS 372 5.7.2 EXTENDED FREGE SYSTEMS 393
5.7.3 FREGE SYSTEMS AND THE PHP 398 5.8 OPEN PROBLEMS 403 5.9 HISTORICAL
AND BIBLIOGRAPHICAL REMARKS 405 5.10 EXERCISES 406 6. MACHINE MODELS AND
FUNCTION ALGEBRAS 413 6.1 INTRODUCTION 413 6.2 MACHINE MODELS 415 6.2.1
TURING MACHINES 415 6.2.2 PARALLEL MACHINE MODEL 424 6.2.3 EXAMPLE
PARALLEL ALGORITHMS 427 6.2.4 LOGP MODEL 433 6.2.5 CIRCUIT FAMILIES : .
434 6.3 SOME RECURSION SCHEMES 437 6.3.1 AN ALGEBRA FOR THE LOGTIME
HIERARCHY LH 438 6.3.2 BOUNDED RECURSION ON NOTATION 450 6.3.3 BOUNDED
RECURSION 458 6.3.4 BOUNDED MINIMIZATION 465 6.3.5 MISCELLANEOUS 470
6.3.6 SAFE RECURSION 478 6.4 A GLIMPSE OF OTHER WORK 487 6.5 HISTORICAL
AND BIBLIOGRAPHICAL REMARKS 488 6.6 EXERCISES 489 7. HIGHER TYPES 497
7.1 INTRODUCTION 497 7.2 TYPE 2 FUNCTIONAL 497 7.3 SOME CLOSURE
PROPERTIES OF AQ 502 7.4 SQUARE-ROOT AND MULTIPLE RECURSION 511 7.5
PARALLEL MACHINE MODEL 527 7.6 A-CALCULI FOR PARALLEL COMPUTABLE HIGHER
TYPE FUNCTIONALS . . 554 7.6.1 INTRODUCTION TO HIGHER TYPES 555 7.6.2
P-TYPES 556 7.6.3 FINITE TYPED LAMBDA CALCULUS 558 7.7 HISTORICAL AND
BIBLIOGRAPHICAL REMARKS 564 7.8 EXERCISES 565 REFERENCES 569 INDEX 591
|
| any_adam_object | 1 |
| author | Clote, Peter Kranakis, Evangelos |
| author_facet | Clote, Peter Kranakis, Evangelos |
| author_role | aut aut |
| author_sort | Clote, Peter |
| author_variant | p c pc e k ek |
| building | Verbundindex |
| bvnumber | BV013738581 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 SK 890 ST 130 |
| classification_tum | DAT 195f |
| ctrlnum | (OCoLC)46791075 (DE-599)BVBBV013738581 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02226nam a22005898c 4500</leader><controlfield tag="001">BV013738581</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060906 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">010515s2002 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">961200553</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540594361</subfield><subfield code="9">3-540-59436-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46791075</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013738581</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-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clote, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Boolean functions and computation models</subfield><subfield code="c">Peter Clote ; Evangelos Kranakis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 601 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Texts in theoretical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Boole, Algèbre de</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="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</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="689" ind1="0" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</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">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kranakis, Evangelos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009390946&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009390946</subfield></datafield></record></collection> |
| id | DE-604.BV013738581 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:51:08Z |
| institution | BVB |
| isbn | 3540594361 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009390946 |
| oclc_num | 46791075 |
| open_access_boolean | |
| owner | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-19 DE-BY-UBM DE-M347 DE-384 DE-634 DE-11 |
| owner_facet | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-19 DE-BY-UBM DE-M347 DE-384 DE-634 DE-11 |
| physical | XIV, 601 S. graph. Darst. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in theoretical computer science |
| spelling | Clote, Peter Verfasser aut Boolean functions and computation models Peter Clote ; Evangelos Kranakis Berlin [u.a.] Springer 2002 XIV, 601 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science Algoritmen gtt Boole, Algèbre de Boolean-functions gtt Complexité de calcul (Informatique) Algebra, Boolean Computational complexity Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Computer (DE-588)4070083-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Computer (DE-588)4070083-5 s Mathematisches Modell (DE-588)4114528-8 s DE-604 Boolesche Funktion (DE-588)4146281-6 s Berechnungskomplexität (DE-588)4134751-1 s Kranakis, Evangelos Verfasser aut HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009390946&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Clote, Peter Kranakis, Evangelos Boolean functions and computation models Algoritmen gtt Boole, Algèbre de Boolean-functions gtt Complexité de calcul (Informatique) Algebra, Boolean Computational complexity Boolesche Funktion (DE-588)4146281-6 gnd Mathematisches Modell (DE-588)4114528-8 gnd Computer (DE-588)4070083-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4146281-6 (DE-588)4114528-8 (DE-588)4070083-5 (DE-588)4134751-1 |
| title | Boolean functions and computation models |
| title_auth | Boolean functions and computation models |
| title_exact_search | Boolean functions and computation models |
| title_full | Boolean functions and computation models Peter Clote ; Evangelos Kranakis |
| title_fullStr | Boolean functions and computation models Peter Clote ; Evangelos Kranakis |
| title_full_unstemmed | Boolean functions and computation models Peter Clote ; Evangelos Kranakis |
| title_short | Boolean functions and computation models |
| title_sort | boolean functions and computation models |
| topic | Algoritmen gtt Boole, Algèbre de Boolean-functions gtt Complexité de calcul (Informatique) Algebra, Boolean Computational complexity Boolesche Funktion (DE-588)4146281-6 gnd Mathematisches Modell (DE-588)4114528-8 gnd Computer (DE-588)4070083-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Algoritmen Boole, Algèbre de Boolean-functions Complexité de calcul (Informatique) Algebra, Boolean Computational complexity Boolesche Funktion Mathematisches Modell Computer Berechnungskomplexität |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009390946&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT clotepeter booleanfunctionsandcomputationmodels AT kranakisevangelos booleanfunctionsandcomputationmodels |