A Lower Bound for Sampling Disjoint Sets - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Thomas Watson 0001. A Lower Bound for Sampling Disjoint Sets. Electronic Colloquium on Computational Complexity (ECCC), 26:66, 2019. [doi]

@article{Watson19-0,
  title = {A Lower Bound for Sampling Disjoint Sets},
  author = {Thomas Watson 0001},
  year = {2019},
  url = {https://eccc.weizmann.ac.il/report/2019/066},
  researchr = {https://researchr.org/publication/Watson19-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {26},
  pages = {66},
}

runs on WebDSL