Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

FOCS
2004
IEEE

favoriteEmaildiscussreport

88views Theoretical Computer Science» more FOCS 2004»

Random Edge Can Be Exponential on Abstract Cubes

14 years 2 months ago

Random Edge Can Be Exponential on Abstract Cubes

Download www.inf.ethz.ch

DGE can be exponential on abstract cubes Jir

Jirí Matousek, Tibor Szabó

Real-time Traffic

FOCS 2004 | F¨ur Theoretische Informatik | Informatik ETH Zentrum | Theoretical Computer Science | Theoretische Informatik ETH |

claim paper

Related Content

» Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks

» Can Dynamic Neural Filters Produce PseudoRandom Sequences

» SelfRandomized Exponentiation Algorithms

» A Randomized Solver for Linear Systems with Exponential Convergence

» Exponential separation of quantum and classical oneway communication complexity

» Power Analysis Attacks of Modular Exponentiation in Smartcards

» TwoStage Robust Network Design with Exponential Scenarios

» Random Walks on Colored Graphs

» Can We Have Confidence in a Tree Representation

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	FOCS
Authors	Jirí Matousek, Tibor Szabó

Comments (0)