Sparse Hard Sets for P - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Dieter van Melkebeek, Mitsunori Ogihara. Sparse Hard Sets for P. In Advances in Algorithms, Languages, and Complexity. pages 191-208, 1997.

@inproceedings{MelkebeekO97,
  title = {Sparse Hard Sets for P},
  author = {Dieter van Melkebeek and Mitsunori Ogihara},
  year = {1997},
  researchr = {https://researchr.org/publication/MelkebeekO97},
  cites = {0},
  citedby = {0},
  pages = {191-208},
  booktitle = {Advances in Algorithms, Languages, and Complexity},
}

runs on WebDSL