Sciweavers

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

35

COCO
1994
Springer

favoriteEmaildiscussreport

86views Algorithms» more COCO 1994»

Random Strings Make Hard Instances

14 years 3 months ago

Random Strings Make Hard Instances

Download www.tcs.hut.fi

Harry Buhrman, Pekka Orponen

Real-time Traffic

Algorithms | COCO 1994 |

claim paper

Related Content

» Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques

» Making Hard Problems Harder

» Zaps and Their Applications

» Language Compression and Pseudorandom Generators

» Hardness of routing with congestion in directed graphs

» Backbone Fragility and the Local Search Cost Peak

» Hiding Satisfying Assignments Two Are Better than One

» Redundancy in Random SAT Formulas

» Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	COCO
Authors	Harry Buhrman, Pekka Orponen

Comments (0)