#### Filter Results:

- Full text PDF available (182)

#### Publication Year

1983

2017

- This year (5)
- Last 5 years (52)
- Last 10 years (95)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Uriel Feige
- 1998

Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max k-cover is the problem of selecting k subsets from F such that their union has maximum cardi-nality. Both these problems are NP-hard. We prove that (1 ? o(1)) ln n is a threshold below which… (More)

- Uriel Feige, Amos Fiat, Adi Shamir
- Journal of Cryptology
- 1987

In this paper we extend the notion of zero knowledge proofs of membership (which reveal one bit of information) to zero knowledge proofs of knowledge (which reveal no information whatsoever). After formally defining this notion, we show its relevance to identification schemes, in which parties prove their identity by demonstrating their knowledge rather… (More)

- Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
- 48th Annual IEEE Symposium on Foundations of…
- 2007

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular functions is NP-hard.

- Uriel Feige, Guy Kortsarz, David Peleg
- Algorithmica
- 2001

This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n δ ) , for some δ < 1/3 .

- Uriel Feige, Adi Shamir
- STOC
- 1990

A two par ty protocol in which par ty A uses one of several secret witnesses to an NP assertion is witness indistinguishable if par ty B cannot tell which witness A is actually using. The protocol is witness hiding if by the end of the protocol B cannot compute any new witness which he did not know before the protocol began. Witness hiding is a natural… (More)

- Uriel Feige
- IEEE Conference on Computational Complexity
- 2002

We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicate that this is a research direction that leads to interesting insights. Under the assumption that refuting 3SAT is hard on average on a natural distribution, we derive hardness of approximation results for min bisection, dense… (More)

- Uriel Feige, Michel Goemanst
- 1995

It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feage-Lovdsz (STOC92) semidefinite programming relaxation of one-round… (More)

- Uriel Feige, Joe Kilian
- J. Comput. Syst. Sci.
- 1996

- 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 efficient multi-prover interactive proof for NP languages is constructed, where the verifier uses very few random bits and communication bits. Last, the connection… (More)