481 search results - page 23 / 97 » Martin's game: a lower bound for the number of sets |
RSA
2011
13 years 3 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
TCS
2008
13 years 8 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
ECCC
2010
13 years 7 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...