1 option
Randomization and Approximation Techniques in Computer Science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings / edited by Jose D.P. Rolim, Salil Vadhan.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2483.
- Lecture Notes in Computer Science, 0302-9743 ; 2483
- Language:
- English
- Subjects (All):
- Computer programming.
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Numerical analysis.
- Programming Techniques.
- Mathematics of Computing.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Programming Techniques.
- Mathematics of Computing.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (VIII, 284 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45726-8
- 9783540457268
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.