35 search results - page 7 / 7 » An Efficient Parallel Repetition Theorem |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
AAAI
1993
13 years 6 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
BMCBI
2008
13 years 5 months ago
2008
Background: The number of available genome sequences is increasing, and easy-to-use software that enables efficient comparative analysis is needed. Results: We developed GenomeMat...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
ICPP
1999
IEEE
13 years 9 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...