The complexity of approximating a nonlinear program
- Mihir Bellare
- Phillip Rogaway
- 1995
- Mathematical Programming
Paper
Publications
20 results for Mihir Bellare
On the role of shared randomness in two prover proof systems
- Mihir Bellare
- U. Feige
- et al.
- 1995
- ISTCS 1995
Conference paperRandomness-efficient oblivious sampling
- Mihir Bellare
- John Rompel
- 1994
- FOCS 1994
Conference paperEfficient probabilistically checkable proofs and applications approximation
- Mihir Bellare
- S. Goldwasser
- et al.
- 1994
- STOC 1994
Conference paperImproved non-Approximability results
- Mihir Bellare
- Madhu Sudan
- 1994
- STOC 1994
Conference paperRandomness in interactive proofs
- Mihir Bellare
- Oded Goldreich
- et al.
- 1993
- Computational Complexity
PaperRandom oracles are practical: a paradigm for designing efficient protocols
- Mihir Bellare
- Phillip Rogaway
- 1993
- CCS 1993
Conference paperEfficient probabilistically checkable proofs and applications to approximation
- Mihir Bellare
- S. Goldwasser
- et al.
- 1993
- STOC 1993
Conference paperTechnique for upper bounding the spectral norm with applications to learning
- Mihir Bellare
- 1992
- ACM COLT 1992
Conference paperMaking zero-knowledge provers efficient
- Mihir Bellare
- Erez Petrankt
- 1992
- STOC 1992
Conference paper