| 000 -LEADER |
|---|
| fixed length control field |
03999nam a22004935i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151120.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
110831s2011 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642173646 |
|
978-3-642-17364-6 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA75.5-76.95 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
2011. |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Jukna, Stasys. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Extremal Combinatorics |
| Medium |
[electronic resource] : |
| Remainder of title |
With Applications in Computer Science / |
| Statement of responsibility, etc |
by Stasys Jukna. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XXIV, 308 p. |
| Other physical details |
online resource. |
| 440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Texts in Theoretical Computer Science. An EATCS Series, |
| International Standard Serial Number |
1862-4499 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Preface -- Prolog: What this Book Is About -- Notation -- Counting -- Advanced Counting -- Probabilistic Counting -- The Pigeonhole Principle -- Systems of Distinct Representatives -- Sunflowers -- Intersecting Families -- Chains and Antichains -- Blocking Sets and the Duality -- Density and Universality -- Witness Sets and Isolation -- Designs -- The Basic Method -- Orthogonality and Rank Arguments -- Eigenvalues and Graph Expansion -- The Polynomial Method -- Combinatorics of Codes -- Linearity of Expectation -- The Lovász Sieve -- The Deletion Method -- The Second Moment Method -- The Entropy Function -- Random Walks -- Derandomization -- Ramseyan Theorems for Numbers -- The Hales–Jewett Theorem -- Applications in Communications Complexity -- References -- Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text. This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
|
|---|
| Topical term or geographic name as entry element |
Information theory. |
|
|---|
| Topical term or geographic name as entry element |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Computer science |
| General subdivision |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Number theory. |
|
|---|
| Topical term or geographic name as entry element |
Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
|
|---|
| Topical term or geographic name as entry element |
Number Theory. |
|
|---|
| Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Computational Mathematics and Numerical Analysis. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783642173639 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-17364-6 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
