An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Jozef Vyskoc. An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems. Theoretical Computer Science, 51:221-227, 1987.

@article{Vyskoc87,
  title = {An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems},
  author = {Jozef Vyskoc},
  year = {1987},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Vyskoc87},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {51},
  pages = {221-227},
}

runs on WebDSL