cam a22 4 4500 282823204 CHVBK 20201204110852.0 130818s2001 gw 00 eng GFR-CIP-00,N29 DNB-00,N29,0344 dnb 959158235 GyFmDB 3-540-66313-4 Gb. : DM 79.00 (IDSBB)002088947 (NEBIS)003821381 (SBT)000576311 DDB IDS BS/BE A100 kids 510 15 004 15 05-01 05Dxx 06A07 15A03 68Rxx 68Q17 msc SK 170 rvk SK 890 rvk ST 315 rvk ST 600 rvk Jukna Stasys Extremal combinatorics with applications in computer science Stasys Jukna Berlin Springer 2001 375 S. Ill. Texts in theoretical computer science (IDSBB)001174138 075046067 p. [353]-370 This is an introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with informative proofs. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics. Kombinatorik Extremum idsbb Extremum Kombinatorik idsbb EXTREMALPROBLEME (GRAPHENTHEORIE) ger (ETHUDK)000013520 ethudk KOMBINATORIK + GRAPHENTHEORIE (MATHEMATIK) ger (ETHUDK)000013502 ethudk LEHRBÜCHER (DOKUMENTENTYP) ger (ETHUDK)000000099 ethudk THEORETISCHE INFORMATIK ger (ETHUDK)000052054 ethudk u THEORETISCHE INFORMATIK ger 004*06 nebis E1 u KOMBINATORIK + GRAPHENTHEORIE (MATHEMATIK) ger 519.1 nebis E1 u EXTREMALPROBLEME (GRAPHENTHEORIE) ger 519.176 nebis E1 u LEHRBÜCHER (DOKUMENTENTYP) ger (075) nebis E1 u INFORMATIQUE THÉORIQUE fre 004*06 nebis E1 u THEORETICAL COMPUTER SCIENCE eng 004*06 nebis E1 u COMBINATORICS + GRAPH THEORY (MATHEMATICS) eng 519.1 nebis E1 u ANALYSE COMBINATOIRE + THÉORIE DES GRAPHES (MATHÉMATIQUES) fre 519.1 nebis E1 u EXTREMAL PROBLEMS (GRAPH THEORY) eng 519.176 nebis E1 u PROBLÈMES D'EXTREMUM (THÉORIE DES GRAPHES) fre 519.176 nebis E1 u TEXTBOOKS (DOCUMENT TYPE) eng (075) nebis E1 u MANUELS POUR L'ENSEIGNEMENT (TYPE DE DOCUMENT) fre (075) nebis E1 u 511.6 Analisi combinatoria sbt TE BK020000 XK020000 XK020000 mt SzZuIDS BS/BE if SzZuIDS BS/BE E30MATH E30-20010717 096 E01-20010729 ma SzBzSBTc SBT LUBUL LUBUL 201 BUL A 511.6 JUK EXT NEBIS E30 E30 E30BI EHX 205 NEBIS E72 E72 E72BI OR.01.1 IDSBB A100 A100 100FM UBH Kt 13038 NELA1000108 NEBIS E01 E01 MG 779614 IDSBB 100 1- Jukna Stasys IDSBB 490 0- Texts in theoretical computer science (IDSBB)001174138 075046067 NEBIS 490 -- Texts in theoretical computer science NEBIS 700 1- Jukna Stasys SBT 100 1- Jukna Stasys SBT 490 -- Texts in theoretical computer science : an EATCS series NEBIS EAD50 EBI01 E01 https://opac.nebis.ch/objects/pdf/000023916_e01_3540663134_02.pdf Abstract / Autoreninformation VIEW pdf IDSBB DSV51 DSV01 A100 http://www.ub.unibas.ch/tox/HBZ/HT011134586/PDF pdf VIEW Inhaltsverzeichnis SWISSBIB 033048622