Randomization and Approximation Techniques in Computer Science [[electronic resource] ] : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings / / edited by Jose D.P. Rolim, Salil Vadhan
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Randomization and Approximation Techniques in Computer Science [[electronic resource] ] : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings / / edited by Jose D.P. Rolim, Salil Vadhan
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Edizione: | 1st ed. 2002. |
| Descrizione fisica: | 1 online resource (VIII, 284 p.) |
| Disciplina: | 004/.07/27 |
| Soggetto topico: | Computer programming |
| Computer science—Mathematics | |
| Algorithms | |
| Numerical analysis | |
| Programming Techniques | |
| Mathematics of Computing | |
| Algorithm Analysis and Problem Complexity | |
| Numeric Computing | |
| Discrete Mathematics in Computer Science | |
| Persona (resp. second.): | RolimJose D.P |
| VadhanSalil | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | Counting Distinct Elements in a Data Stream -- On Testing Convexity and Submodularity -- ?-Regular Languages Are Testable with a Constant Number of Queries -- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes -- Counting and Sampling H-Colourings -- Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs -- On the 2-Colorability of Random Hypergraphs -- Percolation on Finite Cayley Graphs -- Computing Graph Properties by Randomized Subcube Partitions -- Bisection of Random Cubic Graphs -- Small k-Dominating Sets of Regular Graphs -- Finding Sparse Induced Subgraphs of Semirandom Graphs -- Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View -- Quantum Walks on the Hypercube -- Randomness-Optimal Characterization of Two NP Proof Systems -- A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms -- Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good -- Is Constraint Satisfaction Over Two Variables Always Easy? -- Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications -- On the Eigenvalue Power Law -- Classifying Special Interest Groups in Web Graphs. |
| Titolo autorizzato: | Randomization and Approximation Techniques in Computer Science |
| ISBN: | 3-540-45726-7 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465570103316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 2483