36 search results - page 1 / 8 » Theorems on Efficient Argument Reductions |
ARITH
2003
IEEE
13 years 9 months ago
2003
IEEE
TCC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques ease knowledge acquisition by generati...