Boolean function complexity: advances and frontiers
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Schriftenreihe: | Algorithms and combinatorics
27 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XV, 617 S. graph. Darst. 24 cm |
| ISBN: | 9783642245077 9783642245084 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039879319 | ||
| 003 | DE-604 | ||
| 005 | 20120404 | ||
| 007 | t | ||
| 008 | 120209s2012 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 1014976707 |2 DE-101 | |
| 020 | |a 9783642245077 |9 978-3-642-24507-7 | ||
| 020 | |a 9783642245084 |c eISBN |9 978-3-642-24508-4 | ||
| 035 | |a (OCoLC)766342710 | ||
| 035 | |a (DE-599)DNB1014976707 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-11 |a DE-188 |a DE-19 |a DE-703 |a DE-83 | ||
| 082 | 0 | |a 004.01511326 |2 22/ger | |
| 082 | 0 | |a 621.395 |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 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 621.3 |2 sdnb | ||
| 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 XV, 617 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |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 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 Binäres Entscheidungsdiagramm |0 (DE-588)4530728-3 |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 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 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t Boolean Function Complexity |
| 830 | 0 | |a Algorithms and combinatorics |v 27 |w (DE-604)BV000617357 |9 27 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3876171&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024738463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024738463 | |
Datensatz im Suchindex
| _version_ | 1805146074280624128 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
PART I THE BASICS 1 OUR ADVERSARY: THE CIRCUIT 3
1.1 BOOLEAN FUNCTIONS 3
1.2 CIRCUITS 12
1.3 BRANCHING PROGRAMS 17
1.4 ALMOST ALL FUNCTIONS ARE COMPLEX 21
1.4.1 CIRCUITS 22
1.4.2 APPROXIMATION COMPLEXITY 26
1.4.3 THE CIRCUIT HIERARCHY THEOREM 29
1.4.4 SWITCHING NETWORKS AND FORMULAS 30
1.4.5 INVARIANT CLASSES 33
1.5 SO WHERE ARE THE COMPLEX FUNCTIONS? 36
1.5.1 ON EXPLICITNESS 36
1.5.2 EXPLICIT LOWER BOUNDS 37
1.6 A3 LOWER BOUND FOR CIRCUITS 38
1.7 GRAPH COMPLEXITY 40
1.7.1 CLIQUE COMPLEXITY OF GRAPHS 41
1.7.2 STAR COMPLEXITY OF GRAPHS 42
1.8 A CONSTANT FACTOR AWAY FROM P ^ NP? 45
EXERCISES '. 48
2 ANALYSIS OF BOOLEAN FUNCTIONS 55
2.1 BOOLEAN FUNCTIONS AS POLYNOMIALS 55
2.2 REAL DEGREE OF BOOLEAN FUNCTIONS 56
2.3 THE FOURIER TRANSFORM 59
2.4 BOOLEAN 0/1 VERSUS FOURIER 1 REPRESENTATION 62
2.5 APPROXIMATING THE VALUES 0 AND 1 63
2.6 APPROXIMATION BY LOW-DEGREE POLYNOMIALS 64
2.7 SIGN-APPROXIMATION 67
2.8 SENSITIVITY AND INFLUENCES 68
EXERCISES 76
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1014976707
DIGITALISIERT DURCH
IMAGE 2
X CONTENTS
PART II COMMUNICATION COMPLEXITY
3 GAMES ON RELATIONS 81
3.1 COMMUNICATION PROTOCOLS AND RECTANGLES 81
3.2 PROTOCOLS AND TILING 84
3.3 GAMES AND CIRCUIT DEPTH 88
3.3.1 MONOTONE DEPTH 90
EXERCISES 91
4 GAMES ON 0-1 MATRICES 93
4.1 DETERMINISTIC COMMUNICATION 93
4.2 NONDETERMINISTIC COMMUNICATION 96
4.2.1 GREEDY BOUNDS 98
4.2.2 FOOLING-SET BOUNDS 99
4.3 P = NP N CO-NP FOR FIXED-PARTITION GAMES 101
4.4 CLIQUE VS. INDEPENDENT SET GAME 104
4.5 COMMUNICATION AND RANK 106
4.6 THE LOG-RANK CONJECTURE 107
4.6.1 KNOWNGAPS 108
4.6.2 SMALL RANK IMPLIES LARGE DISCREPANCY 110
4.6.3 RANK AND CHROMATIC NUMBER 112
4.7 COMMUNICATION WITH RESTRICTED ADVICE 114
4.8 P ^ NP N CO-NP FOR BEST-PARTITION GAMES 116
4.9 RANDOMIZED COMMUNICATION 119
4.9.1 DISTRIBUTIONAL COMPLEXITY 119
4.10 LOWER BOUND FOR THE DISJOINTNESS FUNCTION 121
4.11 UNBOUNDED ERROR COMMUNICATION AND SIGN-RANK 124 4.12 PRIVATE VS.
PUBLIC RANDOMNESS 128
EXERCISES 130
5 MULTI-PARTY GAMES 135
5.1 THE "NUMBER-IN-HAND" MODEL 136
5.2 THE APPROXIMATE SET PACKING PROBLEM 137
5.3 APPLICATION: STREAMING ALGORITHMS 139
5.4 THE "NUMBER-ON-FOREHEAD" MODEL 140
5.5 THE DISCREPANCY BOUND 143
5.6 GENERALIZED INNER PRODUCT 146
5.7 MATRIX MULTIPLICATION 148
5.8 BEST-PARTITION A;-PARTY COMMUNICATION 150
EXERCISES 153
PART III CIRCUIT COMPLEXITY
6 FORMULAS 159
6.1 SIZE VERSUS DEPTH 159
6.2 A QUADRATIC LOWER BOUND FOR UNIVERSAL FUNCTIONS 164
IMAGE 3
CONTENTS XI
6.3 THE EFFECT OF RANDOM RESTRICTIONS 167
6.4 A CUBIC LOWER BOUND 170
6.5 NECHIPORUK'S THEOREM 172
6.6 LOWER BOUNDS FOR SYMMETRIC FUNCTIONS 174
6.7 FORMULAS AND RECTANGLES 176
6.8 KHRAPCHENKO'S THEOREM 179
6.9 COMPLEXITY IS NOT CONVEX 182
6.10 COMPLEXITY IS NOT SUBMODULAR 187
6.11 THE DRAG-ALONG PRINCIPLE 189
6.12 BOUNDS BASED ON GRAPH MEASURES 190
6.13 LOWER BOUNDS VIA GRAPH ENTROPY 193
6.14 FORMULA SIZE, RANK AND AFFINE DIMENSION 196
6.14.1 AFFINE DIMENSION AND FORMULAS 197
6.14.2 PROJECTIVE DIMENSION AND BRANCHING PROGRAMS 199 EXERCISES 200
7 MONOTONE FORMULAS 205
7.1 THE RANK ARGUMENT 205
7.2 LOWER BOUNDS FOR QUADRATIC FUNCTIONS 206
7.3 A SUPER-POLYNOMIAL SIZE LOWER BOUND 209
7.3.1 RANK OF DISJOINTNESS MATRICES 210
7.3.2 A LOWER BOUND FOR PALEY FUNCTIONS 211
7.4 A LOG 2 N DEPTH LOWER BOUND FOR CONNECTIVITY 213
7.4.1 REDUCTION TO THE FORK GAME 214
7.4.2 LOWER BOUND FOR THE FORK GAME 216
7.5 AN N 1/I6 DEPTH LOWER BOUND FOR CLIQUE FUNCTION 219
7.6 ANN 1/2 DEPTH LOWER BOUND FOR MATCHING 224
EXERCISES 227
8 SPAN PROGRAMS 229
8.1 THE MODEL 229
8.2 THE POWER OF SPAN PROGRAMS 231
8.3 POWER OF MONOTONE SPAN PROGRAMS 232
8.4 THRESHOLD FUNCTIONS 233
8.5 THE WEAKNESS OF MONOTONE SPAN PROGRAMS 235
8.6 SELF-AVOIDING FAMILIES 236
8.7 CHARACTERIZATION OF SPAN PROGRAM SIZE 238
8.8 MONOTONE SPAN PROGRAMS AND SECRET SHARING 240
EXERCISES 241
9 MONOTONE CIRCUITS 245
9.1 LARGE CLIQUES ARE HARD TO DETECT 245
9.1.1 CONSTRUCTION OF THE APPROXIMATED CIRCUIT 247
9.1.2 BOUNDING ERRORS OF APPROXIMATION 248
9.2 VERY LARGE CLIQUES ARE EASY TO DETECT 251
9.2.1 PROPERTIES OF T-CRITICAL GRAPHS 252
9.3 THE MONOTONE SWITCHING LEMMA 257
IMAGE 4
XI I CONTENTS
9.4 THE LOWER-BOUNDS CRITERION 259
9.5 EXPLICIT LOWER BOUNDS 261
9.5.1 DETECTING TRIANGLES 261
9.5.2 GRAPHS OF POLYNOMIALS 262
9.6 CIRCUITS WITH REAL-VALUED GATES 263
9.7 CRITERION FOR GRAPH PROPERTIES 267
9.8 CLIQUE-LIKE PROBLEMS 269
9.9 WHAT ABOUT CIRCUITS WITH NOT GATES? 273
9.10 RAZBOROV'S METHOD OF APPROXIMATIONS 274
9.10.1 CONSTRUCTION OF LEGITIMATE LATTICES 275
9.11 A LOWER BOUND FOR PERFECT MATCHING 276
9.11.1 ERROR-PROBABILITY ON ACCEPTED INPUTS 278
9.11.2 ERROR-PROBABILITY ON REJECTED INPUTS 279
EXERCISES 282
10 THE MYSTERY OF NEGATIONS 285
10.1 WHEN ARE NOT GATES USELESS? 285
10.1.1 SLICE FUNCTIONS 286
10.1.2 NEGATED INPUTS AS NEW VARIABLES 288
10.2 MARKOV'S THEOREM 289
10.3 FORMULAS REQUIRE EXPONENTIALLY MORE NOT GATES 293 10.4 FISCHER'S
THEOREM 295
10.5 HOW MANY NEGATIONS ARE ENOUGH TO PROVE P ^ NP? 297
EXERCISES 299
PART IV BOUNDED DEPTH CIRCUITS
11 DEPTH-3 CIRCUITS 303
11.1 WHY IS DEPTH 3 INTERESTING? 303
11.2 AN EASY LOWER BOUND FOR PARITY 306
11.3 THE METHOD OF FINITE LIMITS 306
11.4 A LOWER BOUND FOR MAJORITY 309
11.5 NP T CO-NP FOR DEPTH-3 CIRCUITS 310
11.6 GRAPH THEORETIC LOWER BOUNDS 313
11.7 DEPTH-2 CIRCUITS AND RAMSEY GRAPHS 315
11.8 DEPTH-3 CIRCUITS AND SIGNUM RANK 317
11.9 DEPTH-3 CIRCUITS WITH PARITY GATES 321
11.10 THRESHOLD CIRCUITS 326
11.10.1 GENERAL THRESHOLD CIRCUITS 327
11.10.2 THRESHOLD CIRCUITS OF DEPTH TWO 329
11.10.3 THRESHOLD CIRCUITS OF DEPTH THREE 333
EXERCISES 336
12 LARGE-DEPTH CIRCUITS 339
12.1 HASTAD'S SWITCHING LEMMA 339
12.2 RAZBOROV'S PROOF OF THE SWITCHING LEMMA 341
IMAGE 5
CONTENTS XIII
12.3 PARITY AND MAJORITY ARE NOT IN AC 0 343
12.3.1 MAJORITY OF AC 0 CIRCUITS 348
12.3.2 PARITY IS EVEN HARD TO APPROXIMATE 349
12.4 CONSTANT-DEPTH CIRCUITS AND AVERAGE SENSITIVITY 350 12.5 CIRCUITS
WITH PARITY GATES 354
12.6 CIRCUITS WITH MODULAR GATES 357
12.7 CIRCUITS WITH SYMMETRIC GATES 363
12.8 RIGID MATRICES REQUIRE LARGE CIRCUITS 365
EXERCISES 369
13 CIRCUITS WITH ARBITRARY GATES 371
13.1 ENTROPY AND THE NUMBER OF WIRES 372
13.2 ENTROPY AND DEPTH-TWO CIRCUITS 374
13.3 MATRIX PRODUCT IS HARD IN DEPTH TWO 376
13.3.1 RESTRICTED MATRIX PRODUCT IS EASY IN DEPTH THREE 377 13.4
LARGER-DEPTH CIRCUITS 378
13.5 LINEAR CIRCUITS FOR LINEAR OPERATORS 382
13.6 CIRCUITS WITH OR GATES: RECTIFIER NETWORKS 386
13.6.1 CIRCUITS WITH OR AND AND GATES 388
13.6.2 ASYMPTOTIC BOUNDS 390
13.7 NON-LINEAR CIRCUITS FOR LINEAR OPERATORS 391
13.8 RELATION TO CIRCUITS OF LOGARITHMIC DEPTH 394
EXERCISES 399
PART V BRANCHING PROGRAMS
14 DECISION TREES 405
14.1 ADVERSARY ARGUMENTS 405
14.2 P = NP N CO-NP FOR DECISION TREE DEPTH 407
14.3 CERTIFICATES, SENSITIVITY AND BLOCK SENSITIVITY 409
14.3.1 BLOCK SENSITIVITY VERSUS CERTIFICATE COMPLEXITY 412 14.3.2 BLOCK
SENSITIVITY VERSUS DEPTH 412
14.3.3 SENSITIVITY AND DEGREE OF POLYNOMIALS 414
14.4 SENSITIVITY AND SUBGRAPHS OF THE -CUBE 416
14.5 EVASIVE BOOLEAN FUNCTIONS 418
14.6 DECISION TREES FOR SEARCH PROBLEMS 421
14.7 LINEAR DECISION TREES 424
14.8 ELEMENT DISTINCTNESS AND TURAN'S THEOREM 425
14.9 P T NP N CO-NP FOR DECISION TREE SIZE 427
14.9.1 SPECTRAL LOWER BOUND 430
14.9.2 EXPLICIT LOWER BOUNDS 432
EXERCISES 435
15 GENERAL BRANCHING PROGRAMS 439
15.1 NECHIPORUK'S LOWER BOUNDS 439
15.1.1 LOWER BOUNDS FOR SYMMETRIC FUNCTIONS 441
IMAGE 6
XIV CONTENTS
15.2 BRANCHING PROGRAMS OVER LARGE DOMAINS 442
15.3 COUNTING VERSUS NONDETERMINISM 445
15.4 A SURPRISE: BARRINGTON'S THEOREM 447
15.5 OBLIVIOUS BRANCHING PROGRAMS 451
EXERCISES 454
16 BOUNDED REPLICATION 457
16.1 READ-ONCE PROGRAMS: NO REPLICATIONS 458
16.2 P 5E NP N CO-NP FOR READ-ONCE PROGRAMS 460
16.3 BRANCHING PROGRAMS WITHOUT NULL-PATHS 461
16.4 PARITY BRANCHING PROGRAMS 465
16.5 LINEAR CODES REQUIRE LARGE REPLICATION 467
16.6 EXPANDERS REQUIRE ALMOST MAXIMAL REPLICATION 470
16.6.1 QUADRATIC FUNCTIONS OF EXPANDERS ARE HARD 474 EXERCISES 477
17 BOUNDED TIME 479
17.1 THE RECTANGLE LEMMA 480
17.2 A LOWER BOUND FOR CODE FUNCTIONS 481
17.3 PROOF OF THE RECTANGLE LEMMA 483
EXERCISES 489
PART VI FRAGMENTS OF PROOF COMPLEXITY
18 RESOLUTION 493
18.1 RESOLUTION REFUTATION PROOFS 494
18.2 RESOLUTION AND BRANCHING PROGRAMS 495
18.3 LOWER BOUNDS FOR TREE-LIKE RESOLUTION 498
18.4 TREE-LIKE VERSUS REGULAR RESOLUTION 503
18.5 LOWER BOUNDS FORGENERAL RESOLUTION 505
18.6 SIZE VERSUS WIDTH 508
18.7 TSEITIN FORMULAS 511
18.8 EXPANDERS FORCE LARGE WIDTH 514
18.9 MATCHING PRINCIPLES FOR GRAPHS 516
EXERCISES 517
19 CUTTING PLANE PROOFS 521
19.1 CUTTING PLANES AS PROOFS 521
19.2 CUTTING PLANES AND RESOLUTION 523
19.3 LOWER BOUNDS FOR TREE-LIKE CP PROOFS 526
19.3.1 LOWER BOUND FOR THE MATCHING CNF 528
19.4 LOWER BOUNDS FOR GENERAL CP PROOFS 530
19.4.1 THE CLIQUE-COLORING POLYTOPE 533
19.5 CHVATALRANK 536
19.6 RANK VERSUS DEPTH OF CP PROOFS 539
IMAGE 7
CONTENTS XV
19.7 LOWER BOUNDS ON CHVATAL RANK 540
19.7.1 THE MAXIMUM INDEPENDENT SET PROBLEM 541
19.7.2 THE SET-COVERING PROBLEM 545
19.7.3 THE KNAPSACK PROBLEM 547
19.7.4 AN UPPER BOUNDS ON THE PROOF SIZE 548
19.8 GENERAL CP PROOFS CANNOT BE BALANCED 549
19.8.1 SIZE VERSUS DEPTH OF CP PROOFS 550
19.9 INTEGRALITY GAPS 551
EXERCISES 553
20 EPILOGUE 557
20.1 PSEUDO-RANDOM GENERATORS 557
20.2 NATURAL PROOFS 561
20.3 THE FUSION METHOD 564
20.4 INDIRECT PROOFS 568
20.4.1 WILLIAMS'LOWER BOUND 569
20.4.2 KANNAN'S LOWER BOUND 569
A MATHEMATICAL BACKGROUND 575
A.I BASICS AND NOTATION 575
A.2 GRAPHS 575
A.3 LINEAR ALGEBRA 577
A.4 PROBABILITY THEORY 585
REFERENCES 591
INDEX 611 |
| any_adam_object | 1 |
| author | Jukna, Stasys |
| author_facet | Jukna, Stasys |
| author_role | aut |
| author_sort | Jukna, Stasys |
| author_variant | s j sj |
| building | Verbundindex |
| bvnumber | BV039879319 |
| classification_rvk | SK 170 ST 134 |
| ctrlnum | (OCoLC)766342710 (DE-599)DNB1014976707 |
| dewey-full | 004.01511326 621.395 |
| dewey-hundreds | 000 - Computer science, information, general works 600 - Technology (Applied sciences) |
| dewey-ones | 004 - Computer science 621 - Applied physics |
| dewey-raw | 004.01511326 621.395 |
| dewey-search | 004.01511326 621.395 |
| dewey-sort | 14.01511326 |
| dewey-tens | 000 - Computer science, information, general works 620 - Engineering and allied operations |
| discipline | Informatik Mathematik Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV039879319</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120404</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120209s2012 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1014976707</subfield><subfield code="2">DE-101</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">eISBN</subfield><subfield code="9">978-3-642-24508-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)766342710</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1014976707</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-739</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.01511326</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.395</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">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">621.3</subfield><subfield code="2">sdnb</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">XV, 617 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">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">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">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">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">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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="t">Boolean Function Complexity</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)BV000617357</subfield><subfield code="9">27</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3876171&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=024738463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024738463</subfield></datafield></record></collection> |
| id | DE-604.BV039879319 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:24:07Z |
| institution | BVB |
| isbn | 9783642245077 9783642245084 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024738463 |
| oclc_num | 766342710 |
| open_access_boolean | |
| owner | DE-739 DE-11 DE-188 DE-19 DE-BY-UBM DE-703 DE-83 |
| owner_facet | DE-739 DE-11 DE-188 DE-19 DE-BY-UBM DE-703 DE-83 |
| physical | XV, 617 S. graph. Darst. 24 cm |
| 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 XV, 617 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Algorithms and combinatorics 27 Schaltfunktion (DE-588)4209765-4 gnd rswk-swf Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Beweissystem (DE-588)4711800-3 gnd rswk-swf Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf 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 Erscheint auch als Online-Ausgabe Boolean Function Complexity Algorithms and combinatorics 27 (DE-604)BV000617357 27 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3876171&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024738463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Jukna, Stasys Boolean function complexity advances and frontiers Algorithms and combinatorics Schaltfunktion (DE-588)4209765-4 gnd Boolesche Funktion (DE-588)4146281-6 gnd Beweissystem (DE-588)4711800-3 gnd Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4209765-4 (DE-588)4146281-6 (DE-588)4711800-3 (DE-588)4530728-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 Boolesche Funktion (DE-588)4146281-6 gnd Beweissystem (DE-588)4711800-3 gnd Binäres Entscheidungsdiagramm (DE-588)4530728-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Schaltfunktion Boolesche Funktion Beweissystem Binäres Entscheidungsdiagramm Berechnungskomplexität |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3876171&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024738463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000617357 |
| work_keys_str_mv | AT juknastasys booleanfunctioncomplexityadvancesandfrontiers |