#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1989

2018

- This year (2)
- Last 5 years (25)
- Last 10 years (54)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ran Raz
- STOC
- 1995

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 previously known. The… (More)

- Ran Raz, Shmuel Safra
- STOC
- 1997

We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of dimension 2), rather than the restriction to lines (i. e., afine… (More)

- Ran Raz
- Electronic Colloquium on Computational Complexity
- 2004

We show how to extract random bits from two or more independent weak random sources in cases where only one source is of linear min-entropy and all other sources are of logarithmic min-entropy. Our… (More)

- Ran Raz
- Electronic Colloquium on Computational Complexity
- 2003

An arithmetic formula is multilinear if the polynomial computed by each of its subformulas is multilinear. We prove that any multilinear arithmetic formula for the permanent or the determinant of an… (More)

- Hani Neuvirth, Ran Raz, Gideon Schreiber
- Journal of molecular biology
- 2004

Is the whole protein surface available for interaction with other proteins, or are specific sites pre-assigned according to their biophysical and structural character? And if so, is it possible to… (More)

- Ran Raz
- STOC
- 1999

Communication complexity has become a central completity model. In that model, we count the amount of communication bits needed between two parties in order to solve certain computational problems.… (More)

- Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
- SODA
- 2001

We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional… (More)

- Ran Raz
- Electronic Colloquium on Computational Complexity
- 2001

(MATH) We prove that any Resolution proof for the weak pigeon hole principle, with <i>n</i> holes and any number of pigeons, is of length ω(2<sup>n</sup>ε<sup></sup>), (for some constant ε ρ 0). One… (More)

- Ran Raz, Pierre McKenzie
- FOCS
- 1997

- Ran Raz, Amir Shpilka
- computational complexity
- 2004

We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases: 1. Non-commutative arithmetic formulas: The algorithm gets as an input an arithmetic… (More)