#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1985

2018

- This year (2)
- Last 5 years (8)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sanjeev Arora, Shmuel Safra
- FOCS
- 1992

We give a new characterization of NP: the class NP contains exactly those languages <italic>L</italic> for which membership proofs (a proof that an input <italic>x</italic> is in <italic>L</italic>)… (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)

- Shmuel Safra
- FOCS
- 1988

Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order theory of one successor. Muller suggested deterministic w-automata as a… (More)

- Irit Dinur, Shmuel Safra
- Electronic Colloquium on Computational Complexity
- 2001

(MATH) We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than $10\sqrt{5}-21 \approx 1.36067$, improving on the previously known hardness result for… (More)

- Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
- J. Comput. Syst. Sci.
- 1998

In this paper we consider two party communication complexity when the input sizes of the two players differ significantly, the “asymmetric” case. Most of previous work on communication complexity… (More)

- Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
- J. ACM
- 1996

The contribution of this paper is two-fold. First, a connection is established between approximating the size of the largest clique in a graph and multi-prover interactive proofs. Second, an… (More)

- Adi Akavia, Shafi Goldwasser, Shmuel Safra
- FOCS
- 2003

We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old results in an entirely… (More)

- Noga Alon, Dana Moshkovitz, Shmuel Safra
- ACM Trans. Algorithms
- 2006

This work addresses k-restriction problems, which unify combinatorial problems of the following type: The goal is to construct a short list of strings in Σm that satisfies a given set of k-wise… (More)

- Irit Dinur, Shmuel Safra
- Electronic Colloquium on Computational Complexity
- 1999

The LABEL-COVER problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symp on Foundations of Computer Science, 1993, pp. 724–733], serves as a starting point for… (More)