With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Bin Fu. With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. In Structure in Complexity Theory Conference. pages 185-191, 1993.

@inproceedings{Fu93,
  title = {With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets},
  author = {Bin Fu},
  year = {1993},
  researchr = {https://researchr.org/publication/Fu93},
  cites = {0},
  citedby = {0},
  pages = {185-191},
  booktitle = {Structure in Complexity Theory Conference},
}

runs on WebDSL