Korotezki Waldemar

Computational Theory and Mathematics · 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

Whom Korotezki Waldemar trusts

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

  1. Subhash Khot (in Computational Theory and Mathematics)

Papers from Korotezki Waldemar's perspective

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

  1. A theory of the learnable
  2. IP = PSPACE
  3. Probabilistic checking of proofs: a new characterization of NP
  4. How to share a secret
  5. Reducibility Among Combinatorial Problems
  6. New Directions in Cryptography
  7. How to construct random functions
  8. On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
  9. The complexity of theorem-proving procedures
  10. Some optimal inapproximability results

Their papers