Proving that prBPP=prP is as hard as "almost" proving that P \ne NP - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Roei Tell. Proving that prBPP=prP is as hard as "almost" proving that P \ne NP. Electronic Colloquium on Computational Complexity (ECCC), 25:3, 2018. [doi]

@article{Tell18,
  title = {Proving that prBPP=prP is as hard as "almost" proving that P \ne NP},
  author = {Roei Tell},
  year = {2018},
  url = {https://eccc.weizmann.ac.il/report/2018/003},
  researchr = {https://researchr.org/publication/Tell18},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {25},
  pages = {3},
}

runs on WebDSL