1450 search results - page 58 / 290 » On the Complexity of Hardness Amplification |
AIML
2004
13 years 10 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
SOQUA
2007
13 years 10 months ago
2007
The impossibility of statically determining the behavior of complex systems that interact at runtime with heterogeneous devices and remote entities, may lead to unexpected system ...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...