The ::::k::::-F::EATURE:: S::ET:: problem is ::::W::::[2]-complete

Carlos Cotta, Pablo Moscato. The ::::k::::-F::EATURE:: S::ET:: problem is ::::W::::[2]-complete. J. Comput. Syst. Sci., 67(4):686-690, 2003. [doi]

@article{CottaM03:0,
  title = {The ::::k::::-F::EATURE:: S::ET:: problem is ::::W::::[2]-complete},
  author = {Carlos Cotta and Pablo Moscato},
  year = {2003},
  doi = {10.1016/S0022-0000(03)00081-3},
  url = {http://dx.doi.org/10.1016/S0022-0000(03)00081-3},
  tags = {completeness},
  researchr = {https://researchr.org/publication/CottaM03%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {67},
  number = {4},
  pages = {686-690},
}