Randomization and Approximation Techniques in Computer Science - Rolim, Jose D.P.; Vadhan, Salil; (ed.) - Prospero Internet Bookshop
Basket (0)
Wishlist (0)
Your personal newsletter
__

Randomization and Approximation Techniques in Computer Science: 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings
 
Product details:
ISBN13:9783540441472
ISBN10:3540441476
Binding:Paperback
No. of pages:284 pages
Size:235x155 mm
Weight:910 g
Language:English
Illustrations: VIII, 284 p.
0
Category:

Randomization and Approximation Techniques in Computer Science

6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings
 
Edition number: 2002
Publisher: Springer
Date of Publication:
Number of Volumes: 1 pieces, Book
 
Normal price:
Publisher's listprice:
EUR 53.49
Estimated price in HUF:
22 690 HUF (21 609 HUF + 5% VAT)
Why estimated?
 
Your price:
20 874 (19 880 HUF + 5% VAT )
discount is: 8% (approx 1 815 HUF off)
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
 
Add to basket
  Piece(s)

 
Long description:
Springer Book Archives
Table of 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.