d-collapsibility is NP-complete for d greater or equal to 4 - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Martin Tancer. d-collapsibility is NP-complete for d greater or equal to 4. Chicago J. Theor. Comput. Sci., 2010, 2010. [doi]

@article{Tancer10,
  title = {d-collapsibility is NP-complete for d greater or equal to 4},
  author = {Martin Tancer},
  year = {2010},
  url = {http://cjtcs.cs.uchicago.edu/articles/2010/3/contents.html},
  researchr = {https://researchr.org/publication/Tancer10},
  cites = {0},
  citedby = {0},
  journal = {Chicago J. Theor. Comput. Sci.},
  volume = {2010},
}

runs on WebDSL