Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes

Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi. Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. In Ding-Zhu Du, Donglei Du, Chenchen wu, Dachuan Xu, editors, Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings. Volume 13135 of Lecture Notes in Computer Science, pages 348-363, Springer, 2021. [doi]

@inproceedings{ParanhosSSO21,
  title = {Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes},
  author = {Raffael M. Paranhos and Janio Carlos Nascimento Silva and Uéverton S. Souza and Luiz Satoru Ochi},
  year = {2021},
  doi = {10.1007/978-3-030-92681-6_28},
  url = {https://doi.org/10.1007/978-3-030-92681-6_28},
  researchr = {https://researchr.org/publication/ParanhosSSO21},
  cites = {0},
  citedby = {0},
  pages = {348-363},
  booktitle = {Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings},
  editor = {Ding-Zhu Du and Donglei Du and Chenchen wu and Dachuan Xu},
  volume = {13135},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-92681-6},
}