Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Iannis Tourlakis. Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. In IEEE Conference on Computational Complexity. pages 22, 2000. [doi]

@inproceedings{Tourlakis00,
  title = {Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines},
  author = {Iannis Tourlakis},
  year = {2000},
  url = {http://computer.org/proceedings/coco/0674/06740022abs.htm},
  researchr = {https://researchr.org/publication/Tourlakis00},
  cites = {0},
  citedby = {0},
  pages = {22},
  booktitle = {IEEE Conference on Computational Complexity},
}

runs on WebDSL