Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ARITH
2003
IEEE

favoriteEmaildiscussreport

86views Applied Computing» more ARITH 2003»

Theorems on Efficient Argument Reductions

13 years 8 months ago

Theorems on Efficient Argument Reductions

Download www.dec.usc.es

Ren-Cang Li, Sylvie Boldo, Marc Daumas

Real-time Traffic

Applied Computing | ARITH 2003 |

claim paper

Related Content

» An Efficient Parallel Repetition Theorem

» Are PCPs Inherent in Efficient Arguments

» Generic Density and Small Span Theorem

» Argumentation Based Constraint Acquisition

» Efficiency Bounds for Adversary Constructions in BlackBox Reductions

» On a Network Generalization of the Minmax Theorem

» A New Interactive Hashing Theorem

» Response Compaction for Test Time and Test Pins Reduction Based on Advanced Convolutional ...

» Constructive Proofs of Concentration Bounds

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2003
Where	ARITH
Authors	Ren-Cang Li, Sylvie Boldo, Marc Daumas

Comments (0)