Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computational discrete mathematics : advanced lectures / Helmut Alt (ed.)
| Computational discrete mathematics : advanced lectures / Helmut Alt (ed.) |
| Pubbl/distr/stampa | Berlin [etc.] : Springer-Verlag, copyr. 2001 |
| Descrizione fisica | VI, 171 p. : ill. ; 20 cm |
| Disciplina | 512 |
| Collana | Lecture notes in computer science |
| Soggetto non controllato |
Calcolo combinatorio
Logica matematica |
| ISBN | 3-540-42775-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000970910203316 |
| Berlin [etc.] : Springer-Verlag, copyr. 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt
| Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 173 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer programming Computer science—Mathematics Computer graphics Combinatorics Algorithm Analysis and Problem Complexity Programming Techniques Mathematics of Computing Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45506-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. |
| Record Nr. | UNISA-996465803503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Discrete Mathematics : Advanced Lectures / / edited by Helmut Alt
| Computational Discrete Mathematics : Advanced Lectures / / edited by Helmut Alt |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 173 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer programming Computer science—Mathematics Computer graphics Combinatorial analysis Algorithm Analysis and Problem Complexity Programming Techniques Mathematics of Computing Discrete Mathematics in Computer Science Computer Graphics Combinatorics |
| ISBN | 3-540-45506-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. |
| Record Nr. | UNINA-9910143592503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||