Pseudorandom Self-Reductions for NP-Complete Problems

Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda. Pseudorandom Self-Reductions for NP-Complete Problems. Electronic Colloquium on Computational Complexity (ECCC), 28:170, 2021. [doi]

@article{ElrazikRSY21,
  title = {Pseudorandom Self-Reductions for NP-Complete Problems},
  author = {Reyad Abed Elrazik and Robert Robere and Assaf Schuster and Gal Yehuda},
  year = {2021},
  url = {https://eccc.weizmann.ac.il/report/2021/170},
  researchr = {https://researchr.org/publication/ElrazikRSY21},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {28},
  pages = {170},
}