Valentine Kabanets

Symposium on the Theory of Computing · 2003

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Whom Valentine Kabanets trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. H. Nader
  2. Jacob T. Schwartz
  3. Leslie G. Valiant
  4. Sanjeev Arora
  5. Adi Shamir
  6. László Babai

Who trusts Valentine Kabanets overall

  1. Leonid Gurvits
  2. Ryan Williams
  3. Amir Shpilka
  4. Gary L. Mullen
  5. Kiran S. Kedlaya
  6. Kousha Etessami

Papers from Valentine Kabanets's perspective

Ordered by how strongly the researchers Valentine Kabanets trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The Complexity of Computing the Permanent
  2. Probabilistic checking of proofs: a new characterization of NP
  3. IP = PSPACE
  4. PRIMES is in P
  5. Probabilistic algorithms for sparse polynomials
  6. Non-deterministic exponential time has two-prover interactive protocols (Computational Complexity)
  7. Fast Probabilistic Algorithms for Verification of Polynomial Identities
  8. I Computational Complexity
  9. Proof verification and hardness of approximation problems
  10. A theory of the learnable

Their papers