2252 search results - page 380 / 451 » Lower Bounds for Dynamic Algorithms |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
COCO
2010
Springer
14 years 24 days ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
APPROX
2006
Springer
14 years 19 days ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...