45 search results - page 5 / 9 » The Intersection Theorem for Direct Products |
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
STOC
1995
ACM
13 years 10 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
CAI
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
GCB
2004
Springer
14 years 12 days ago
2004
Springer
: Carbon Labeling Systems (CLS) are large equation systems that describe the dynamics of labeled carbon atoms in a metabolic network. The rapid solution of these systems is the alg...
COCO
2010
Springer
13 years 10 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...