Sciweavers

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

87

SAGA
2007
Springer

85views Control Systems» more SAGA 2007»

Lower Bounds for Hit-and-Run Direct Search

15 years 9 months ago

Lower Bounds for Hit-and-Run Direct Search

Download ls2-www.cs.uni-dortmund.de

Jens Jägersküpper

Real-time Traffic

SAGA 2007 |

claim paper

Related Content

» A New Quantum Lower Bound Method with an Application to a Strong Direct Product Theorem fo...

» Directed soft arc consistency in pseudo trees

» Algebraic Lower Bounds for Computing on Encrypted Data

» Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem

» Inverting a permutation is as hard as unordered search

» OnLine Approximate String Matching with Bounded Errors

» Computational Bounds on Hierarchical Data Processing with Applications to Information Secu...

» On Multiway Spatial Joins with Direction Predicates

» Heuristic Search Planning with BDDs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SAGA
Authors	Jens Jägersküpper

Comments (0)