Sciweavers

22 search results - page 1 / 5
» Ramsey properties of random discrete structures
Sort
View
RSA
2010
89views more  RSA 2010»
13 years 9 months ago
Ramsey properties of random discrete structures
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
TAMC
2010
Springer
14 years 4 months ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 11 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 8 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
ECAL
2003
Springer
14 years 4 months ago
Contextual Random Boolean Networks
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
Carlos Gershenson, Jan Broekaert, Diederik Aerts