S. Ravi
Computational Theory and Mathematics · with Luciano · 2017
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 26 citations into it
Whom S. Ravi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts S. Ravi overall
Papers from S. Ravi's perspective
Ordered by how strongly the researchers S. Ravi trusts endorse each paper. Same corpus, a different order for every researcher.
- A theory of the learnable
- Probabilistic checking of proofs: a new characterization of NP
- IP = PSPACE
- Reducibility Among Combinatorial Problems
- How to share a secret
- New Directions in Cryptography
- How to construct random functions
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- The complexity of theorem-proving procedures
- Some optimal inapproximability results
Their papers
- A MODERN APPROACH (2017) — 557 citations