Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13 15, 2002 : proceedings
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | , |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
2483 |
| נושאים: | |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Randomization and approximation techniques in computer science, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, proceedings, José D.P. Rolim, Salil Vadhan (eds.), Berlin, Springer, 2002, 1 vol. (VIII-275 p.), Lecture notes in computer science, 3-540-44147-6 • Randomization and Approximation Techniques in Computer Science, Texte imprimé, 9783662178690 |
תוכן הענינים:
- 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.